int s = 20; for(int i=1; i 1; j=j/2){ s++; s =s *j; } for(int k=0; k

int s = 20;

for(int i=1; i

for(int j=n; j>1; j=j/2){

s++;

s =s *j;

}

for(int k=0; k

if (....)

s=s*j;

Find best case and worst cases complexity