0 votes 0 votes Algorithms time-complexity + – anonymous asked Jun 15, 2017 anonymous 491 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes ya bro same as your earlier q @SumitGoyal ans will be n^5 as just multiply max possible time all loops can run i.e n * n^2 * n^2 = n^5 aik138463 answered Jun 16, 2017 aik138463 comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments anonymous commented Jun 17, 2017 reply Follow Share thanku its helpful :)) 0 votes 0 votes vamp_vaibhav commented Sep 29, 2017 reply Follow Share Answer given in diagram is wrong?? Plz explain I think this Is correct.. 0 votes 0 votes rajatmyname commented Apr 23, 2018 reply Follow Share I think answer should be O(n^4) 0 votes 0 votes Please log in or register to add a comment.
