base/sort.jl has the algorithms InsertionSort, MergeSort, and QuickSort, yet I hear folks talk about counting, radix, and TimSort builtin to julia (e.g. https://julia-ylwu.readthedocs.io/en/latest/stdlib/sort.html for TimSort). I couldn’t find any other algorithms from methods(sort!) or methods(sort) within Julia’s standard library, but might be missing something.
Is there some reason Julia’s Base.sort! doesn’t use TimSort, dual-pivot quick sort, quadsort, or some-such as a default sorting algorithm with multiple dispatch to radix, counting, etc. for special cases?
I imagine that it takes quite some thought and discussion to pick a language/stdlib’s default sorting algorithm(s), but haven’t been able to find that discussion for Julia. Is anyone aware of where that discussion is?