Question: Consider the following algorithm: int i , j , k = 0 ; for ( i = n / 2 ; i < = n;

Consider the following algorithm:
int i, j, k =0;
for (i = n /2; i <= n; i++){
for (j =2; j <= n; j = j *2){
k = k + n /2;
}
}
What is the time complexity of this algorithm?

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!