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

but merge sort is not in-place (at least not any remotely practical variant); heap sort is simple, in-place and O(n log n), although it is not a stable sort as merge sort.



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

Search: