1.2 Algorithmic Design

An algorithm is a precise, step-by-step set of instructions designed to solve a problem or complete a task. Algorithms have characteristics such as being clear, finite, and ordered. Their purpose is to create reliable, repeatable solutions that can be followed by humans or computers.

Algorithms can be expressed using flowcharts or written descriptions. Flowcharts use symbols such as terminators, processes, sub-processes, decisions, inputs/outputs, arrows, and labels. Written descriptions use hierarchical markers to show sequence clearly.

Flowcharts visually represent algorithms, making them easy to understand and follow. However, they can become complex for large algorithms and are time-consuming to update.

Written descriptions are flexible and easy to modify. They suit detailed explanations but may be harder to visualise and can cause confusion without clear structure.

Algorithms use sequence (steps in order), selection (decision-making), and iteration (repetition of steps) to control how tasks are executed.

This involves analysing an algorithm to understand what it is designed to achieve and how it functions.

Given an input, you should be able to trace the steps of the algorithm to accurately determine the final output.

Error identification involves spotting logical, structural, or sequencing issues that prevent the algorithm from working correctly.

This means fixing mistakes in logic, flow, or structure to ensure the algorithm behaves as intended.

This involves creating new algorithms using sequence, selection, and iteration to solve problems effectively.