The answer is D. The program prints:
58
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 |
|---|---|---|
| 2 | yes | 2 |
| 7 | yes | 7 |
| 16 | yes | 16 |
| 58 | yes | 58 |
| 45 | no | 58 |
The code again
numbers = [2, 7, 16, 58, 45]
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.