Thinking Like a Computer: Algorithms and Pseudocode

Imagine you had to write instructions so precise that a robot — with zero common sense — could make a bowl of cereal without making a single mistake. Would 'pour some milk' be precise enough? Probably not. The robot might pour the entire carton. Every tiny decision needs spelling out: how much milk, what to do if the bowl is already full, when to stop pouring. This is exactly the challenge programmers face every day.

An algorithm is a finite, ordered set of precise instructions that solves a problem or completes a task. 'Finite' means it must eventually stop. 'Ordered' means the sequence matters. 'Precise' means every step is unambiguous — a computer cannot guess your intentions. Programmers often plan algorithms using pseudocode before writing real code. Pseudocode is a way of describing an algorithm in plain, structured English that looks a little like code but has no strict syntax rules. It lets you focus on logic rather than the spelling rules of a particular programming language. Pseudocode uses three core building blocks: 1. SEQUENCE — steps carried out one after another in order. Example: SET total ← 0 INPUT number SET total ← total + number 2. SELECTION — the algorithm makes a choice using IF … THEN … ELSE … ENDIF. Example: IF score ≥ 50 THEN OUTPUT "Pass" ELSE OUTPUT "Try again" ENDIF 3. ITERATION — steps repeated using WHILE … ENDWHILE or FOR … ENDFOR. Example: FOR counter ← 1 TO 5 OUTPUT counter ENDFOR This outputs the numbers 1, 2, 3, 4, 5. Tracing an algorithm means working through it line by line, keeping track of every variable's value, exactly as a computer would. A trace table records each variable after every step — it is an essential tool for checking that your algorithm is correct before you write a single line of real code.