J sort

From Wikipedia, the free encyclopedia

Jump to: navigation, search

Not to be confused with JSort.

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] References

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

^ A revolutionary new sort from John Cohen

v d e Sorting algorithms

Theory	Computational complexity theory Big O notation Total order Lists Stability Comparison sort Adaptive sort Sorting network Integer sorting

Exchange sorts	Bubble sort Cocktail sort Odd–even sort Comb sort Gnome sort Quicksort Stooge sort Bogosort

Selection sorts	Selection sort Heapsort Smoothsort Cartesian tree sort Tournament sort Cycle sort

Insertion sorts	Insertion sort Shellsort Tree sort Library sort Patience sorting

Merge sorts	Merge sort Polyphase merge sort Strand sort

Distribution sorts	American flag sort Bead sort Bucket sort Burstsort Counting sort Pigeonhole sort Proxmap sort Radix sort Flashsort

Concurrent sorts	Bitonic sorter Batcher odd–even mergesort Pairwise sorting network

Hybrid sorts	Timsort Introsort Spreadsort UnShuffle sort JSort

Other	Bogosort Topological sorting Pancake sorting Spaghetti sort

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "http://en.wikipedia.org/w/index.php?title=J_sort&oldid=407644411"

Hidden categories:

WikiProject Computer science stubs

Personal tools

Log in / create account

Interaction

Toolbox

Print/export