For(int i=1;i<=n;i*=2)    StatementI'm making notes for competitive exam and made this problem. But I'm not getting solution. Is it O( log n)? If so why?
Big o of for loop with multiplication iteration
algorithm analysis;runtime analysis;loops