Samplesort
Encyclopedia
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.
In recent years, the algorithm has been adapted to implement randomized sorting on parallel computers.
Adapted for use on parallel computers:
Sorting algorithm
In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order...
described in the 1970 paper "Samplesort: A Sampling Approach to Minimal Storage Tree Sorting", by W D Frazer and A C McKellar.
In recent years, the algorithm has been adapted to implement randomized sorting on parallel computers.
External links
Frazer and McKellar's samplesort and derivatives:- Frazer and McKellar's original paper
- http://www.springerlink.com/content/p70564506802n575/
- http://www.springerlink.com/content/l211p1q526j84174/
Adapted for use on parallel computers:
- http://www.cse.ohio-state.edu/~kerwin/MPIGpu.pdf
- http://citeseer.ist.psu.edu/91922.html
- http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.214