1 votes 1 votes Algorithms time-complexity descriptive made-easy-booklet + – amit166 asked Nov 24, 2018 retagged Jun 23, 2022 by Lakshman Bhaiya amit166 346 views answer comment Share Follow See all 6 Comments See all 6 6 Comments reply amit166 commented Nov 24, 2018 reply Follow Share find time complexity 0 votes 0 votes himgta commented Nov 24, 2018 reply Follow Share @amit166 options are not given? 0 votes 0 votes amit166 commented Nov 24, 2018 reply Follow Share it gate overflow old questions 0 votes 0 votes OneZero commented Nov 27, 2018 reply Follow Share i got the answer to be n^2, but i am not sure. 0 votes 0 votes Hira Thakur commented Nov 27, 2018 reply Follow Share fourth for loop will run constant time?? so TC is $(n^2)$?? 0 votes 0 votes adarsh_1997 commented Dec 3, 2018 reply Follow Share yes.i think it will be 0(n^2) 0 votes 0 votes Please log in or register to add a comment.