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

Bubble sort is the first one I learned, so I remember it the best. I never spent any time comparing any of the O(n^2) sorts so it never occurred to me to try a different one.



And here am I, just using what's in the standard library. of the language I'm writing. Never occured to me to try a different one.


This was quite a while ago, and the library sort was QSort which had a lot of overhead due to its calling convention. Today I'd have no problem using std::sort instead.




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

Search: