0 votes 0 votes Kaluti asked Oct 14, 2017 Kaluti 890 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Kaluti commented Oct 14, 2017 reply Follow Share can u explain how many times you are getting your k loop run? 0 votes 0 votes joshi_nitish commented Oct 14, 2017 reply Follow Share asymtotically, if condition is always true, so you can solve above problem assuming there is no if 0 votes 0 votes Kaluti commented Oct 14, 2017 reply Follow Share second loop takes O(n^(2)) time and k loop that is third one taking O(n^(3)) time bigger of the two will be O(n^(3)) the time complexity of program is my analysis correct? 0 votes 0 votes Please log in or register to add a comment.