Question: sum = 0 ; for ( k = 1 ; k < = n; k * = 2 ) for ( j = n; j
sum ; for k; kn; k for jn; j; j
sum;
The time complexity of the algorithm is
Select one:
a Olog n
b Ologn
C Olog n
d On
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
