How to Double Your Algorithm

The fastest starts are O of N log N. And that basically means they're mostly linear. But every time you multiply the number of things by 10 times, say, it adds a small constant total. So N log N is slower than linear, but it's barely slower. It is slower in a way that barely matters as the number of objects get large. That has to be multiplied by an enormous number for that to matter.