NIST

J sort

(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.

See also sort, JSort.

Note: Called "quick-er sort" by one Théodore Myshrall in an apparent plagiarism for a 1998 school project.

Author: PEB

More information

John Cohen says in a message posted in November 1997 that he invented this algorithm.

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 25 October 2024.
HTML page formatted Fri Oct 25 17:12:30 2024.

Cite this as:
Paul E. Black, "J sort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 25 October 2024. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/j_sort.html