Big O Analysis for Algorithm

Question

Next in my series of Big O questions that I can't find the answer to

Take the following example

for(int i = 0; i < someNumber; i++)
{
    for(int j = i; j < someNumber; j++)
    {
        DoSomething();
    }
}

Would this still be considered O(n^2)? I only ask because I feel that this has to be less that O(n^2), since the inner loop is executing less and less for every iteration of i (since j is starting closer and closer to someNumber).

Thanks

Answer 1

The outer loop runs n times. The inner loop starts out running n times, but decreases with each iteration of the outer loop, until the last iteration where it only runs once. The code inside the inner loop will run

n + (n−1) + ... + 2 + 1

times.

That can be simplified to n(n + 1)/2 ( proof ), or n ² /2 + n/2, or finally (n ² + n) / 2. Since the first term is n ² , the algorithm is in O(n ² ).