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, email@example.com, comp.theory, 25 Feb 2000.
J. H. Reif and L. G. Valiant, A logarithmic time sort for linear size networks, Proc. 15th Annual STOC, pages 10-16, 1983.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 24 May 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.
Cite this as:
"flash sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 24 May 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/flashsort.html