Triple nested loop complexity I'm trying to determine the complexity of the following structure:

for (i = 1; i &lt; n; i++)

for (j = 1; j &lt; o; j++)

for (k = 1; k &lt; p; k++)

print "Hello world!"


Normally, for a triple loop like this, I believe the complexity is O(n^3), but the undefined variables "o" and "p" are throwing a wrench in the works. I've done
some hunting around, and the best I can surmise is that it might be O(n * o * p), depending on what values are assigned to n, o and p. Thanks for taking a look!
$O(nop)$ is indeed exactly the best upper bound one can conclude for this program without additional information. The bound $O(n^3)$ cannot be shown unless you know $o$ and $p$ are themselves $O(n)$. On the other hand, if you knew $o$ and $p$ were actually constants, then you could prove a bound of $O(n)$ for the entire program.