☑Kizspy.me
(Choose 1 answer)
(See picture)
☐ A
A. 3
B. 4
C. 2
☐ E
D. None of the other choices is correct
E. 8
Next
Back
Given the algorithm
procedure la (a1, a2, ...,an integers)
m: a
t:=0
fori:= 2 to n
if (a; > m) then
m: a
t: t+1
If the input is the list
[1, 6, 2, 3, 7, 7, 4, 8, 8, 6]
how many additions are used?
FUO.sh
sh the exam.
