3 ms·
I've never heard anyone say that either, but it's not uncommon for O(n^2) algorithms to creep in and cause problems. Sometimes these issues don't actually "brin
by quicklime 7y ago
I've never heard anyone say that either, but it's not uncommon for O(n^2) algorithms to creep in and cause problems. Sometimes these issues don't actually "bring the site down", but still cause headaches. In my experience, I end up finding and fixing a problem like this about once per year on average, and I've been working as a software engineer for about 10 years.