NIST

JSort

(algorithm)

Definition: An in-place sort that partially orders the array twice with build-heap, once moving lesser items earlier and once in reverse moving greater items later, then uses insertion sort on the nearly-ordered array.

Generalization (I am a kind of ...)
in-place sort.

Aggregate child (... is a part of or used in me.)
build-heap, insertion sort, heap.

See also sort, heapsort, J sort.

Note: The implementation attributes the algorithm to Jason Morrison.

Author: PEB

Implementation

Demonstration and source code (Java).
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 29 September 2014.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "JSort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 29 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/JSort.html