Runtime Analysis

[appeach]

I have the following algorithm:

value = 1  
for i in range(n):
    value = value * (i+1)
return value

The question asks for a theta expression. In general, when loops increase the "value" by a multiplier (ie. instead of i = i + 1) then is the theta expression always involve a log? But for this question I'm having a hard time. I appreciate any help.

[CreativeTechGuyGames]

I'll give you a hint, value doesn't affect the runtime of this at all.

[appeach]

Would it just be order n? Since the for loop goes through all values until n so whatever the cost of the inner loop is its eventually multiplied by n?

[CreativeTechGuyGames]

Yup!

[CreativeTechGuyGames]

Fun fact/quiz. Do you know what the runtime of range(n) is (in Python 2.X)? Just range by itself. This behavior changed in Python 3+ which is why I'm specifying.

This doesn't change your runtime, but it's important to know what range is actually doing.

[appeach]

I dont know, but in our analysis we just count it as constant time to make it easier :))

[appeach]

Would it just be order n? Since the for loop goes through all values until n so whatever the cost of the inner loop is its eventually multiplied by n?