What is the complexity of this code?

Question

void conundrum (int n) {
int i, j, k;
int r = 0;
for(i=1; i<=n; i++)
for (j = i+1; j<= n; j++)
for (k=i+j-1; k<= n; k++)
r = r+1; }

Answer 1

thank u @Ran 😊

Answer 2

Exactly!

Answer 3

Worst case scenario : O(n³)

Answer 4

You're welcome!

Answer 5

The time complexity of a code is roughly N to the power of the maximum number of nested for loops.
Here it is 3, so O(N³)