The answer is C. The program prints:
36
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 |
|---|---|---|
| 33 | yes | 33 |
| 36 | yes | 36 |
| 1 | no | 36 |
| 12 | no | 36 |
| 2 | no | 36 |
The code again
numbers = [33, 36, 1, 12, 2]
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.