3 ms·
Until you simplify your sort function into insert sort (which, admittedly, is really fast before container size hits triple digits)
by __s 11y ago
Until you simplify your sort function into insert sort (which, admittedly, is really fast before container size hits triple digits)
- brianwawok 11y agoeven Quicksort got faster if you check for runs i.e. already sorted parts. More code but faster.