6 ms·
Not only is it not proper quicksort, it's very memory inefficient.
by stianan 15y ago
Not only is it not proper quicksort, it's very memory inefficient.
- eru 15y agoDepends on your GC and compiler.
- stianan 15y agoI'd argue that it's a good thing to use an algorithm that is efficient in and of itself. (And perhaps a language which invites the use of such an algorithm.)
- eru 15y agoThe efficiency of algorithms depends on the language / model of computation you are using. For an extreme example, the best way to write an efficient matrix multiplication in Fortran is to write a naive matrix multiplication. The compiler will recognize the pattern, and transform it.