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 ...)
Aggregate child (... is a part of or used in me.)
strand sort, shuffle sort.
See also sort, JSort.
Note: Called "quick-er sort" by one Théodore Myshrall in an apparent plagiarism for a 1998 school project.
John Cohen says in a message posted in November 1997 that he invented this algorithm.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 8 September 2015.
HTML page formatted Fri Feb 23 10:06:07 2018.
Cite this as:
Paul E. Black, "J sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 8 September 2015. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/jsort.html