Hello,

I am trying to solve the complexity of a triple nested loop. The code is as follows:

for(int i = 1; i < n; i++)

for(int j = 1; j < o; j++)

for(int k = 1; k < p; k++)

I know the outer loop runs in O(n) time, but the inner two have me confused, as the variables o and p are otherwise undefined, so I'm not entirely sure if it executes

in O(n^3) or not. Thank you.