[Too]

Good point. It’s more about choosing a good algorithm though.

A brute force O(N) in C++ may be fast enough, in a situation where you need to use O(logN) to get the equivalent speed in Python. Squeezing out a few extra percent from a O(N) in Python by using slots will not be enough.

Of course that doesn’t mean you shouldn’t leave performance on the table if the optimizations have noticeable effects.

[josephg]

Right. Another way I’ve heard it put is that a Python program running on a modern computer is equivalent to the same go program running on a computer from 20 years ago.