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

Quicksort is O(n log n) average and O(n^2) worst case. Heapsort is O(n log n) for both average and worst case.


Consider applying for YC's Summer 2026 batch! Applications are open till May 4

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

Search: