0 votes 0 votes Algorithms time-complexity + – highheels10 asked Sep 15, 2018 • retagged Jun 18, 2022 by makhdoom ghaya highheels10 509 views answer comment Share Follow See 1 comment See all 1 1 comment reply Magma commented Sep 15, 2018 reply Follow Share O(n2) 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes O(n^3) abhi19961 answered Sep 15, 2018 abhi19961 comment Share Follow See all 3 Comments See all 3 3 Comments reply abhi19961 commented Sep 15, 2018 reply Follow Share Ans still is n^3. O(n^2) is actually the no of times 100 gets printed. 0 votes 0 votes highheels10 commented Sep 15, 2018 reply Follow Share okay 0 votes 0 votes highheels10 commented Sep 15, 2018 reply Follow Share in this qus time complexity should be O(n^5) but according to ravula ans is O(n^4). 0 votes 0 votes Please log in or register to add a comment.