1 1 vote ``` void f(int n) { int i, j, k, m; for (i=0; i < 100; i ++) { for (j = 0; j < n; j++) { for (k = 0; k < j; k++) printf("%d", k); for (m = 0; m < i; m++) print("%d", m); } } } ``` Algorithms time-complexity descriptive made-easy-booklet + – amit166 878 views answer comment Share Follow Print See all 6 Comments 6 6 Comments reply amit166 commented Nov 24, 2018 reply Follow flag find time complexity 0 0 replyShare himgta commented Nov 24, 2018 reply Follow flag @amit166 options are not given? 0 0 replyShare amit166 commented Nov 24, 2018 reply Follow flag it gate overflow old questions 0 0 replyShare OneZero commented Nov 27, 2018 reply Follow flag i got the answer to be n^2, but i am not sure. 0 0 replyShare Hira Thakur commented Nov 27, 2018 reply Follow flag fourth for loop will run constant time?? so TC is $(n^2)$?? 0 0 replyShare adarsh_1997 commented Dec 3, 2018 reply Follow flag yes.i think it will be 0(n^2) 0 0 replyShare Please log in or register to add a comment.