Big-O Time Complexity of nested for loops My gut tells me the time-complexity of the following code is simply O(n^2).  However, I'm not convinced, thinking it could possibly be O(n^3):

cin &gt;&gt; n;
sum = 0;
for (int i = 0; i &lt; n; i++)
    for (int j = 0; j &lt; n * n; j++)
        sum++;


Can anyone provide a distinction, and why?

Thanks in advance.
Hint: What is the value of sum at the end of the code, as a function of $n$? If it is $s$ then the fifth line must have been run exactly $s$ times.