(algorithm)
Definition: An in-place sort algorithm that uses strand sort to sort fewer than about 40 items and shuffle sort to sort more.
Generalization (I am a kind of ...)
in-place sort.
Aggregate child (... is a part of or used in me.)
strand sort, shuffle sort.
Note: Called "quick-er sort" by one Théodore Myshrall in an apparent plagiarism for a 1998 school project.
Author: PEB
John Cohen says he invented this algorithm in a 1997 message.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 20 September 2006.
HTML page formatted Wed Sep 20 15:07:31 2006.
Cite this as:
Paul E. Black, "J sort", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 20 September 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/jsort.html
