Interpreting pseudocode

Pseudocode is an easy to read language that can be used to describe an algorithm. It has no official definition regarding content; however, the following rules apply (NB Pearson use structured English; this means the content is very flexible AS LONG AS IT IS UNAMBIGUOUS)

●Contain statements which describe actions

●Focus on the logic of the algorithm

●Avoid language-specific elements

●Be written at a level so that the desired programming code can be generated almost automatically from each statement

●Contain steps. Subordinate numbers and/or indentation are used for dependent statements in selection and iteration structures.

Below are some examples of pseudocode statements and their Python equivalents: