Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Stabilize, optimize, and increase robustness of QuickSort (#45222)
* Change partitioning scheme to use scratch space * Randomize pivot selection with a hash-based fallback for when `rand` is unavailable * remove an unnecessary sorting operation in typealias construction in base/show.jl * Seed rng before generating precompile statements * Add presorted check to avoid performance regressions * test invalid `lt` to close #11429 & #32675 * test that PartialQuickSort is stable * update radix sort dispatch heuristics because quicksort is now faster and the primary competition Co-authored-by: Petr Vana <petvana@centrum.cz> Co-authored-by: Oscar Smith <oscardssmith@gmail.com>
- Loading branch information