3 ms·
> // "Min" sort. Not the fastest, but definitely less code than heapsort // or quicksort, and much less swapping than bubblesort/insertionsort. Oh, OK. Glad yo
by jere 14y ago
> // "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.
- calinet6 14y agoWhile 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.