By the end of this section you should be able to create algorithms, or sequences of instructions to solve problems, including getting input from the user and providing them with output.

You will be able to use selection in your algorithms (instructions where decisions have to be made; e.g. turn left or turn right, or switch something on or off) and iteration, where sequences are repeated until there is a required result.

Algorithms can just be sequences of written instructions, but you will also be able to display them visually using flow diagrams and also in pseudocode, a language that is very similar to actual computer languages but is easier for humans to use and understand. You will be able to interpret, correct and complete algorithms, and also analyse, assess and compare them.

In order to use flow diagrams and pseudocode, you will have to be able to use named variables and constants. They are used in algorithms to store values. For more complex algorithms you will be able to use operators to manipulate data, for example to carry out calculations (arithmetic operators), compare values (relational operators) or decide whether statements are true or false (Boolean operators), which then allows you to use conditional statements to handle different cases.

There is nothing more creative than designing algorithms to solve problems. It's like writing a story that even a computer can understand.