The answer is D. The program prints:
23
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 |
|---|---|---|
| 15 | yes | 15 |
| 18 | yes | 18 |
| 11 | no | 18 |
| 23 | yes | 23 |
| 4 | no | 23 |
The code again
numbers = [15, 18, 11, 23, 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.