The answer is B. The program prints:
51
This answer was checked by running the program for real.
Why?
The loop remembers the biggest number it has seen so far, and replaces it whenever it finds a bigger one. This is how computers find the maximum.
Trace table
A trace table follows the program step by step. Here’s this one:
| n | n > biggest? | biggest |
|---|---|---|
| 24 | yes | 24 |
| 41 | yes | 41 |
| 33 | no | 41 |
| 51 | yes | 51 |
| 4 | no | 51 |
The code again
numbers = [24, 41, 33, 51, 4]
biggest = 0
for n in numbers:
if n > biggest:
biggest = n
print(biggest)Try it: change one number in the program and predict the new output before you run it.