This nested loop has a time complexity of O(n²), where n=10 in this case.

Let's analyze why:

The outer loop runs n times (from 0 to 9)

For each iteration i of the outer loop, the inner loop runs (i+1) times

This creates a pattern of operations:

When i=0: 1 operation

When i=1: 2 operations

When i=2: 3 operations

And so on until i=9: 10 operations

The total number of operations follows the pattern:

1 + 2 + 3 + ... + n = n(n+1)/2

As explained in the search results, even though the actual formula is n(n+1)/2,

which is technically O(n²/2), in Big O notation we:

Drop the constants (the /2)

Drop lower order terms

Focus on the growth rate

Therefore, the time complexity is O(n²).