Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Personally, I really like merge sort. It makes few assumptions, it's stable, it works well with sorted inputs, can be split across multiple CPU's, and it works well with sequential input streams. Radix sort tends to be faster especially for strings, but it does not work for many data structures without adapting the algorithm. EX: Radix sorting doubles requires bit manipulation of the data.


Merge sort can be thought of as a kind of binary counting.




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

Search: