NIST

flash sort

(algorithm)

Definition: (no definition here, yet, but you can help.)

Note: It is "a randomized parallel sorting algorithm, similar in a lot of ways to quicksort with lots of pivots used simultaneously. -- Steve Tate, srt@cs.unt.edu, comp.theory, 25 Feb 2000.

More information

J. H. Reif and L. G. Valiant, A logarithmic time sort for linear size networks, Proc. 15th Annual STOC, pages 10-16, 1983.


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 24 May 2004.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
"flash sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 24 May 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/flashsort.html