Hello to all.
I am trying to figure out the time complexity for the following piece of code.
Should I be thinking here about the fact that there are two foor loops? The inner loop executes n times for each run of the outer loop. I think this might have something to do with quadratic time. Or should i be looking at statements like product *= (i*j); Any tips?Code:
for (int i = 1; i < n; i +=10)
for (int j = n; j > 0; j --)
product *= (i*j);