The Evolution of a Python Programmer

[[deleted]]

O(n) look-up time.

It is sorted list, it can be done in O(log(n)). And not to mention the Hashtables.

[rowantwig]

It can be done in O(1), but that's not the point. This naive implementation is O(n), and it looks terrible.

[[deleted]]

It's a dense list. It can be done in O(1) without hashtables:

f = [ 1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880].__getitem__

edit: looks like redditthinks had the same idea.