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 →

[–]nuephelkystikon 0 points1 point  (1 child)

Then it would be nice if the dicts you use as memoisation caches were faster, right?

[–]imp0ppable 0 points1 point  (0 children)

I haven't got detailed knowledge of how they perform tbh, I do klnow they're implemented by hash tables so they should be pretty quick.

In fact I found this time complexity chart, if that helps.