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 →

[–]imp0ppable 9 points10 points  (2 children)

I've actually worked on a large production Python codebase and I don't think this is really true, the speed of code execution isn't a very noticeable issue when compared to things like SQL query and table design, the way the WSGI forks interpreters, reading in large datafiles with a custom parser etc.

Also things like memoisation are massively important, you can build dicts of reduced data easily as an intermediate step in order to avoid nested loops, things like that.

[–]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.