Designing an investigative algorithm
Key knowledgeUnderstand ordered steps, choices and repetition in algorithms and their representation, including pseudocode.
Build the idea
An algorithm needs explicit inputs, an initial state, a sequence of operations and a stopping rule. Decisions and repetition must be unambiguous enough for another person or a computer to follow. Trace a few steps to detect logical errors, then compare the algorithm’s output with an independently derived result and interpret its precision.
Try the sample task
Write pseudocode to compare all half-metre widths in the garden’s feasible interval and report a best width. Include initialisation, repetition and a decision.
The full worksheet includes the worked solution and remaining task set.
What this activity covers
Focused investigation using one shared course-appropriate context; other areas and less structured investigations remain part of the full outcome.