Hacker News new | past | comments | ask | show | jobs | submit login

Until you simplify your sort function into insert sort (which, admittedly, is really fast before container size hits triple digits)



even Quicksort got faster if you check for runs i.e. already sorted parts. More code but faster.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: