Why does Base only have Merge Insertion and Quick sorting algorithms?

Internals & Design
14

and also:

simd-sorting/fast-and-robust

ips4o

Thank you for these links! They look like impressive alternatives for where Julia currently uses QuickSort.

I’m planning to start with a stable sorting algorithm to replace MergeSort. QuadSort (which claims to be faster than TimSort for pretty much all inputs) is the top contender I’ve found so far.