0 votes 0 votes i=n; while(i>0) { j=1; while(j<=n) { j=2*j; } i=i/2; } then what is the time complexity? Algorithms time-complexity + – suneetha asked Oct 30, 2018 edited Oct 30, 2018 by suneetha suneetha 227 views answer comment Share Follow See 1 comment See all 1 1 comment reply Verma Ashish commented Oct 30, 2018 i edited by Verma Ashish Oct 30, 2018 reply Follow Share I think you edited the question. Now complexity has to be (logn)². [ i>1] 0 votes 0 votes Please log in or register to add a comment.