The memory usage of this algorithm can be greatly improved by the use of an in-place partition algorithm. It experiences linear parallelization speedup after pre-processing because it is a strong divide-and-conquer algorithm; the essential step of that pre-processing is choosing pivots. Invented by Hoar, it has drawbacks including numerical instability and a quadratic worst case corresponding to it changing nothing, but that worst-case can be ameliorated by using the competing mergesort at a certain level of refinement.
The memory usage of this algorithm can be greatly improved by the use of an in-place partition algorithm. It experiences linear parallelization speedup after pre-processing because it is a strong divide-and-conquer algorithm; the essential step of that pre-processing is choosing pivots. Invented by Hoar, it has drawbacks including numerical instability and a quadratic worst case corresponding to it changing nothing, but that worst-case can be ameliorated by using the competing mergesort at a certain level of refinement. For 10 points, name this sorting algorithm the common name of which refers to its celerity.
The memory usage of this algorithm can be greatly improved by the use of an in-place partition algorithm.
{quicksort} [accept {Hoar}’s {algorithm} before “Hoar”]