Hello,

I'm trying to determine the algorithmic complexity of the following:

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

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

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

print "Hello world!"

I don't think it's O(n^3), but since n, o and p are undefined, would it just be the product of those three variables?