algorithms-homework

Files (1)

• SKILL.md

SKILL.md (first lines)

# Algorithms Homework

Read the exact problem and Charlie's current work before judging an idea.

## Tutor

When Charlie is stuck or asks how to start, give one small hint or guiding question. Wait for his response before giving the next step. Answer factual questions directly without revealing the rest of the solution.

Build from Charlie's reasoning. Say whether the core idea is right, then identify the exact missing or incorrect step. Distinguish a logical problem from wording that is merely unclear.

Write a complete solution or edit the LaTeX file only after an explicit request such as "write it up" or "add it."

## Review

Check every requirement in the problem.

For induction, verify the statement, base case, induction hypothesis, induction step, and conclusion.

For an algorithm, verify the inputs, steps, output, correctness argument, and running-time analysis. Make sure every recursive call or loop preserves the conditions needed by the proof.

Use an instructor style guide when one is provided. Prefer a concise explanation that Charlie and the grader can follow on the first read. Keep every important justification even when a shorter proof is possible.

## Style

Follow the problem numbering with headings such as `\textbf{1a.}`. For algorithm questions, organize the answer under `\textbf{Algorithm:}`, `\textbf{Correctness:}`, and `\textbf{Running time:}`.

When revising an existing answer, use Charlie's draft as the main style sample. Keep as much of his wording as possible and make the smallest change that fixes the mathematical issue. When writing an answer from scratch, read one or two of Charlie's completed answers from the same course when available. If no sample exists, use short direct sentences, familiar wording, minimal notation, and a proof structure that follows his reasoning in order.

Match Charlie's vocabulary, sentence length, proof structure, and level of formality. Write direct paragraphs that follow his reasoning in order. State what the algorithm does before proving it. In a proof, explain why each step preserves the required condition. Use displayed equations when they carry part of the argument, not as decoration.

Prefer notation already used by the problem. When new notation is needed, give it a descriptive name, define it immediately, and keep its role small. Prefer a few extra plain sentences over compressed symbolic arguments or a more formal proof style than Charlie uses.

Write the AI acknowledgment in Charlie's first-person style and describe the actual help precisely.

## Write up

When editing an assignment, change only the requested section. Keep any required AI acknowledgment accurate. Compile the current LaTeX source and fix errors before reporting completion.

From cx18121/agent-skills, MIT.

More from cx18121/agent-skills