The GATE Grind

GATE 2007 CS – Question 15

Algorithms · Asymptotic Analysis and Time/Space Complexity · 1 mark · Multiple choice

For n>0, how many comparisons are made in this loop?

int j,n;
j=1;
while(j<=n) j=j*2;
  1. $\lceil\log_2n\rceil+1$
  2. n
  3. $\lceil\log_2n\rceil$
  4. $\lfloor\log_2n\rfloor+1$

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) $\lfloor\log_2n\rfloor+1$

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Asymptotic Analysis and Time/Space Complexity questions

All Asymptotic Analysis and Time/Space Complexity questions →