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 claimed to have invented this algorithm.^[1]

[edit] External links

1. ^ Explanation of J sort

[edit] See also

• JSort

[edit] References

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