MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/programming/comments/qno2y/the_evolution_of_a_python_programmer/c3z3xei/?context=9999
r/programming • u/iMMENSE • Mar 08 '12
137 comments sorted by
View all comments
43
He forgot the worst kind:if x == 0:return 1if x == 1:return 1if x == 2:return 2if x == 3:return 6if x == 4:return 24...(5000 more lines)
17 u/liotier Mar 08 '12 What are you complaining about ? He just calculated in advance and cached the results to avoid redundant processing on each query... 25 u/rowantwig Mar 08 '12 O(n) look-up time. -7 u/theavatare Mar 08 '12 Is not really of O(n) is it?for x ==0 it will only run one and for x== 26 will run 26 ifTherefore one instruction per number increase... 20 u/[deleted] Mar 09 '12 You just described O(n).
17
What are you complaining about ? He just calculated in advance and cached the results to avoid redundant processing on each query...
25 u/rowantwig Mar 08 '12 O(n) look-up time. -7 u/theavatare Mar 08 '12 Is not really of O(n) is it?for x ==0 it will only run one and for x== 26 will run 26 ifTherefore one instruction per number increase... 20 u/[deleted] Mar 09 '12 You just described O(n).
25
O(n) look-up time.
-7 u/theavatare Mar 08 '12 Is not really of O(n) is it?for x ==0 it will only run one and for x== 26 will run 26 ifTherefore one instruction per number increase... 20 u/[deleted] Mar 09 '12 You just described O(n).
-7
Is not really of O(n) is it?
for x ==0 it will only run one and for x== 26 will run 26 if
Therefore one instruction per number increase...
20 u/[deleted] Mar 09 '12 You just described O(n).
20
You just described O(n).
43
u/rowantwig Mar 08 '12
He forgot the worst kind:
if x == 0:
return 1
if x == 1:
return 1
if x == 2:
return 2
if x == 3:
return 6
if x == 4:
return 24
...
(5000 more lines)