Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
A diver's depths below the surface are stored as negative heights in metres: , , , , and . The program finds the highest one and its position.
DECLARE Heights : ARRAY[1:6] OF INTEGER
DECLARE Index : INTEGER
DECLARE Best : INTEGER
DECLARE BestIndex : INTEGER
// Heights[1] to Heights[6] are input first
FOR Index ← 1 TO 6
INPUT Heights[Index]
NEXT Index
Best ← Heights[1]
BestIndex ← 1
FOR Index ← 2 TO 6
IF Heights[Index] > Best
THEN
Best ← Heights[Index]
BestIndex ← Index
ENDIF
NEXT Index
OUTPUT Best, " at position ", BestIndexWhat is output? A student starts Best at 0 instead of Heights[1]. What would that version output, and why is it wrong?
DECLARE Name : ARRAY[Lower:Upper] OF TYPE makes a fixed-length array of one data type. An element is Name[Index], and the index may be a variable or an expression. A FOR loop from the lower bound to the upper bound visits every element. Pseudocode arrays usually start at 1; Python lists at 0.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Step 1. The correct program. Best starts as at position 1. at position 2 is greater, so Best becomes at position 2. The other , at position 4, is not greater, so position 2 stays. The output is -5 at position 2.
Step 2. The faulty version. With Best ← 0, no height is greater than 0, so Best stays 0 and BestIndex stays 1. The output would be 0 at position 1, but 0 is not one of the heights.
Answer: at position 2. The faulty version gives 0, a value not in the array.
Watch out. Start the largest and the smallest at the first element, never at a number you guessed.
Log in to join the discussion.
Loading…