3 ms·
> they found that mergesort was actually faster. I wonder if it has anything to do with how a programming language implements lists It probably also has to do
by masklinn 7y ago
> they found that mergesort was actually faster. I wonder if it has anything to do with how a programming language implements lists
It probably also has to do with using a non-in-place quicksort, which is where it really shines. Even more so as you'd implement the low arities using an insertion sort rather than a quicksort, which wouldn't work either for immutable collections.
- deleted 7y ago[deleted]