InterviewBit Problems NESTED_CMPL3 : Unsolved

About the NESTED_CMPL3 : Unsolved category (1)

Same as heap concept O(n) time complexity (1)

Interesting question (1)

This answer should be N * log(N) (10)

Not agree with solution (3)

Solution:- The inner loop runs for the following no of times- N, N/2, N/4, N/8 (16)

NESTED LOOP _Complexity (1)

O(N) is correct (1)

Why it is not O(n*logn) (3)

Infinite loop as N will always be >0 (2)

I already got this is O(n), but (2)

Mathematics behind NESTED_CMP3 (2)

Discussion for solution and those who didn't get in first go: (1)

Its o(N) only .The answer is damn Correct! (1)

The reason it is O(n) (2)

It looks like it is nlogn instead of n (3)

Why isn't it O(nlogn) (7)

Mathematical Proof of the Solution (2)

Solution can be nlogn too (2)

Why it runs in O(n) it seems to be O(N * log N) (4)

Check out my suggestion for why its not n^2 (2)

The solution of the problem should be O(n log n) (3)

Answer May be wrong (1)

Why was the loop for i not taken into consideration while calculating the complex (3)

Outer loop not used (1)

Why isn't it O(n * log(n))? (2)

Why is my code giving no output? (1)

Outer i loop not considered (1)

O(nlogn) is the solution for me! (2)

For me it looks like N (1)