The answer is B. The program prints:
44
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 |
|---|---|---|
| 8 | yes | 8 |
| 17 | yes | 17 |
| 11 | no | 17 |
| 44 | yes | 44 |
| 35 | no | 44 |
The code again
numbers = [8, 17, 11, 44, 35]
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.