Samplesort is a sorting algorithm described in the 1970 paper "Samplesort: A Sampling Approach to Minimal Storage Tree Sorting", by W D Frazer and A C McKellar.
String Samplesort
Recursive samplesort
Leapfrogging Samplesort
Leapfrogging samplesort
Leapfrogging samplesort
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Implementation of samplesort: A minimal storage tree sort
In-place Parallel Super Scalar Samplesort (IPSSSSo)
Average-case analysis of Leapfrogging samplesort
Generalized Leapfrogging Samplesort: A Class of $O(n \log^2 n)$ Worst-Case Complexity and $O(n \log n)$ Average-Case Complexity Sort...
