0 votes 0 votes Will the complexity of the function be $\Theta n^{2} or \Theta n^{3}?$ Algorithms test-series time-complexity + – Ajit J asked Dec 8, 2018 • retagged Jun 11, 2022 by makhdoom ghaya Ajit J 383 views answer comment Share Follow See all 7 Comments See all 7 7 Comments reply Show 4 previous comments Ashwani Kumar 2 commented Dec 8, 2018 reply Follow Share Time complexity is calculated for large value of input. For large value of n else loop will run which is covered by outer for loop. So $O(n^{2})$ 1 votes 1 votes Ajit J commented Dec 8, 2018 reply Follow Share Ashwani Kumar 2 What if there was no else part? Will then the answer be θ($n^{3}$)? 0 votes 0 votes Ashwani Kumar 2 commented Dec 9, 2018 reply Follow Share Yes..If there was no if and else then it will be $O(n^{3})$ 1 votes 1 votes Please log in or register to add a comment.
