title: How is the time complexity of the following function O(n³)?
body: <p>I was going through the Algorithm lecture series of Stanford University on Coursera by Tim Roughgarden. There, he gave a multiple choice question to find the running time complexity of a function, which is given below in the image.</p>
  
  <p><a href="https://i.stack.imgur.com/u1bpY.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/u1bpY.png" alt="enter image description here"></a></p>
  
  <p>In this question, the last three options are correct. I understand how the first two options for Ω (Omega) and Θ (Theta) are correct just by looking at the function, but I am unable to grasp how the last option is correct because as far as I can tell, the running time complexity should be O(n<sup>2</sup>) instead of O(n<sup>3</sup>).</p>
  
  <p>Can anyone please explain where I am wrong?</p>