Question: Can someone explain why the time complexity in big O for this nested loop is not O(nlog(n))? for(i = 1; i
Can someone explain why the time complexity in big O for this nested loop is not O(nlog(n))?
for(i = 1; i <= n; i++):
for(j = 1; j <=i; j = j*2):
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
