☑Kizspy.me
(Choose 1 answer)
(See picture)
☐ A
A. (ii)
B. (iv)
C. (i)
D. (iii)
Give a big-O estimate for the number of operations (where an
operation is an addition or a multiplication) used in this
segment of an algorithm.
k=0
fori 1 ton 1
forji to 2* i
kk+i j
Back
Next
FUO.sh
sh the exam.
(i)
O(n)
(ii) O(nlogn)
(iii) O(n²)
(iv) 0(n4)
end
end
