Testbook test series

Question

Will the complexity of the function be $\Theta n^{2} or \Theta n^{3}?$

Comments

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})$

---

 Ashwani Kumar 2 What if there was no else part? Will then the answer be θ($n^{3}$)?

---

Yes..If there was no if and else then it will be $O(n^{3})$