(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 in a message posted in 1997 that he invented this algorithm.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 24 November 2008.
HTML page formatted Tue Dec 6 16:16:32 2011.
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. 24 November 2008. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/jsort.html
