The answer is A. The program prints:
48
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 |
|---|---|---|
| 16 | yes | 16 |
| 12 | no | 16 |
| 48 | yes | 48 |
| 28 | no | 48 |
| 41 | no | 48 |
The code again
numbers = [16, 12, 48, 28, 41]
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.