Iterative complexity.

Question

Comments

is it  n²/log(n) ??

Answer 1

complexity will be n+n/2+...1(logn terms)

 Solve using Geometric Progression

Ans will be  O(n)

Comments

for loop of i is O(log₂n)

and for loop of j is executed as many times of i

i.e n+n/2+n/4 + ....... =O(n)

so total time complexity is O(nlogn)

can u correct me if im wrong

---

O(n)