Algorithms and Sequencing

Sequencing just means doing steps in a specific order, one after another. It sounds obvious, but order is the whole game: the same steps run in a different order can produce a different answer or stop working altogether. That is because most steps depend on the state left behind by the steps before them. A step that halves total only makes sense once total already holds a meaningful number. Swap it earlier and the rest of the algorithm is now working with the wrong value.

Every algorithm, no matter how complex, is built from three ingredients: sequencing (steps in order), selection (branching with if/else based on a condition), and iteration (repeating steps with a loop). Combine them and you can express any process a computer can carry out. The same algorithm can be written three ways without changing its meaning: as natural language ('set total to 0, add the first number, add the second number, divide by 2'), as a flowchart (boxes and arrows showing the order and any branches or loops), or as pseudocode (structured, code-like lines that are not tied to any real programming language). All three describe the identical sequence of steps.

This matters because an algorithm is the idea, not the implementation. A program is one specific expression of an algorithm, written in a real language like Python or Java, that a computer can actually run. The same algorithm can become many different programs, and a badly sequenced algorithm will produce a buggy program no matter how carefully it is coded, which is why the next step in the course is learning to trace and test these sequences carefully.