(Choose 1 answer)
(See picture)
A. (iii)
B. None of the other choices is correct
C. (i)
D. (ii)
Determine the complexity of this algorithm in terms of the number of comparisons.
procedure thuattoan(a1, a2..., an: integers)k: 0 for i:=1 to n do if a < 0 then k := k+1 print(k)
(i) O(n)
(ii) O(logn)
(iii) O(1)
Exit 36
