Putting it together

Putting it together

• A real algorithm joins the pieces: arrays, loops and selection.
• The exam's standard methods are totalling, counting, linear search, and finding the maximum or minimum.

DECLARE A : ARRAY[1:5] OF INTEGER
DECLARE I, Total : INTEGER
FOR I ← 1 TO 5
    A[I] ← I * 10
NEXT I
Total ← 0
FOR I ← 1 TO 5
    Total ← Total + A[I]
NEXT I
OUTPUT Total

Searching and counting

• Linear search: check each item, and set a flag if you find the target.
• Counting: add 1 to a counter each time a rule is true.

DECLARE A : ARRAY[1:5] OF INTEGER
DECLARE I, Target : INTEGER
DECLARE Found : BOOLEAN
FOR I ← 1 TO 5
    A[I] ← I * 10
NEXT I
Target ← 30
Found ← FALSE
FOR I ← 1 TO 5
    IF A[I] = Target
      THEN
        Found ← TRUE
    ENDIF
NEXT I
OUTPUT Found

Common mistakes

• Plan the structure before you write the pseudocode.
• Match the exam's keywords and layout exactly.

Now you try

• Each task uses an array that is filled for you — write the algorithm.
• Press Check answer to test it.