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

> // "Min" sort. Not the fastest, but definitely less code than heapsort // or quicksort, and much less swapping than bubblesort/insertionsort.

Oh, OK. Glad you could save yourself some time/LOC.



While you're correct to criticize to a degree, there is also something to be said for reducing complexity and preventing bugs by avoiding unnecessarily long algorithms.




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

Search: