Question: 116
(Choose 1 answer)
(See picture)
A. 10
B. 8
C. 7
D. 5
Given the algorithm.
procedure la (a1, a2,..., an integers)m: = a1;t: = 0 for i:= 2 to n if (a; ≥ m) then m:=a;t:= t + 1
E. None of the other choices is correct
If input is the list
[1, 2, 3, 6, 7, 7, 4, 8, 8, 6]
then how many additions are used?
