Question: What is the time complexity T(n) of the nested loops below? For simplicity, you may assume that n is a power of 2. That is,
What is the time complexity T(n) of the nested loops below? For simplicity, you may assume that n is a power of 2. That is, n = 2k for some positive integer k.
i = n ;
while ( i >= 1)
{
j = i ;
while ( j <= n)
{
< body of the while loop> //Needs ( 1 ) .
j = 2 * j;
}
i = floor(i /2) ;
}
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
