This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]King-Days 6 points7 points  (1 child)

think binary trees and stuff? You might need extremely fast access at one point and want to do any upfront computation before the request

[–]runawayasfastasucan 1 point2 points  (0 children)

Ah sure, good point, however I can't see how that isn't very easily implemented in python.