When given an algorithm, there are a number of ways to determine what the purpose of the algorithm is. Sometimes it is clear as the algorithm is simple; however, at other times it is useful to ‘dry run’ the algorithm to see what is taking place.
Dry running an algorithm means to assign the values to variables of an algorithm and to do any processing that takes place without translating it into code.
Trace tables enable the variable values in an algorithm to be recorded as the algorithm is dry run. For example, using the times table algorithm below, a table could be created showing the value of the variables
number as the program runs:
num ← USERINPUT FOR number ← 1 TO 10 OUTPUT number * num ENDFOR
Some algorithms follow a pattern that can be recognised. Many of these are referred to as standard algorithms and often follow a set pattern for searching for or sorting data. Sometimes it is clear what this is just by looking at the pseudo-code. For example, the algorithm below follows a recognisable pattern for searching through each letter of a word and checking if the letter entered matches. This would be a useful decomposed part of a hangman game.
guess ← USERINPUT FOR i ← 0 TO LEN(word) IF word[i] = guess THEN OUTPUT “found” ENDIF ENDFOR