Question: sum = 0 ; for ( k = 1 ; k < = n; k * = 2 ) for ( j = n; j

sum =0; for (k=1; k<=n; k*=2) for (j=n; j<=1; j/=2)
sum++;
The time complexity of the algorithm is
Select one:
a. O(log n^2)
b. O(logn)
C. O((log n)^2)
d. O(n^2)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!