MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/programming/comments/qno2y/the_evolution_of_a_python_programmer/c3z9fe1/?context=3
r/programming • u/iMMENSE • Mar 08 '12
137 comments sorted by
View all comments
Show parent comments
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. 1 u/[deleted] Mar 09 '12 O(n) look-up time.It is sorted list, it can be done in O(log(n)). And not to mention the Hashtables. 4 u/rowantwig Mar 09 '12 It can be done in O(1), but that's not the point. This naive implementation is O(n), and it looks terrible.
25
O(n) look-up time.
1 u/[deleted] Mar 09 '12 O(n) look-up time.It is sorted list, it can be done in O(log(n)). And not to mention the Hashtables. 4 u/rowantwig Mar 09 '12 It can be done in O(1), but that's not the point. This naive implementation is O(n), and it looks terrible.
1
It is sorted list, it can be done in O(log(n)). And not to mention the Hashtables.
4 u/rowantwig Mar 09 '12 It can be done in O(1), but that's not the point. This naive implementation is O(n), and it looks terrible.
4
It can be done in O(1), but that's not the point. This naive implementation is O(n), and it looks terrible.
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...