(Choose 1 answer)
(See picture)
A. (iii)
B. (ii)
C. None of the other choices is correct
D. (i)
E. (iv)
Give a big O estimate for the number of multiplications and additions used in the following algorithm.
procedure Horner (c, ao, a1, a2,..., an: real numbers)
y:= an for i:=1 to n y:=yc+an-i
(i)O(n)
(ii)O(1)
(iii) O(n)
(iv) O(log n)
El 30
