Computer Science › Section F · Algorithms › Topic F.2
Representing algorithms with pseudocode
An algorithm only helps if it can be written down so that nobody misreads it. This topic shows how precise building blocks called primitives remove ambiguity, and sets out the pseudocode used for every algorithm in this section.
In this topic
- Why the way we write matters
- Primitives, syntax and semantics
- Levels of primitives
- What pseudocode is
- Our notation: names and choices
- Our notation: repetition, lists and functions
- Functions and parameters
- Worked example: from English to pseudocode
- Worked example: a function with a loop
- Common mistakes to avoid
- Key takeaways
This topic is part of Wuanberri Pro. Checking your access…