J sort

From Wikipedia, the free encyclopedia

J sort is an in-place sort algorithm that uses strand sort to sort fewer than about 40 items and shuffle sort to sort more. John Cohen (unk) claimed to have invented this algorithm.^[1] It was apparently plagiarized by Théodore Myshrall under the name quick-er sort for a school project in 1998.^[2]

[edit] External links

1. ^ Explanation of J sort
2. ^ QUICK-ER SORT: UN NOUVEL ALGORITHME POUR LE TRI EN PARALLÈLE (.doc format) or Google archive (.html format)

[edit] See also

• JSort

[edit] References

• Paul E. Black, J sort at the NIST Dictionary of Algorithms and Data Structures.