Complexity

Question

#include<stdio.h>
int calculate(int n)
{
    int count=0;
    while(n!=0){
    n=(n&(n<<1));
    count++
    }
  return count;  
    
}

output for calculate(143)

Comments

Number of consicutive one in binary representation of number n.

Answer 1

4 should be answer .

n=143  , 143 <<1 = 286 ,  (143&286) = 14  , therefore n =14 ;

count =1  now 

14 <<1 = 28 , so (14&28) = 12  , n=12

count =2 ;

12<<1  = 24  ,  (24&48) =  16  , n =16

count = 3;

16<<1 = 32  , (16&32) =  0

count  =4 

, now n =0  

next time loop will exit and    so, count =4