1 1 vote Algorithms + – Aditya Bahuguna 713 views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply Shubhanshu commented Jan 7, 2018 reply Follow flag B) O(logn) ? 0 0 replyShare akshat sharma commented Jan 7, 2018 reply Follow flag yes bcz of shift operator multiply with 2 so O( logn ) 0 0 replyShare hs_yadav commented Jan 7, 2018 reply Follow flag .just focus on while loop...here k would be (2i=n) ....i is logn... total excution time is O(logn) 0 0 replyShare Please log in or register to add a comment.