PA of Algorithms Q50

50Consider the following segment of C code
int j, n;
j = i;
while (j < = n)
j = j*2;
The number of comparisons made in the execution of the loop for any n > 0 is

A
B
n
C
D

Option : D
Explanation :
Since, j increases in power of 2's.
if statement j = j * 2 executes k times, then
2^k < n
⇒ k < log₂ n
Since k will be integer,
total number of comparison
(when loop exits)

Forgot your password?

I agree with the Terms.