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

Pat Morin's implementation (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 19 January 2021.
HTML page formatted Tue Jan 19 08:57:16 2021.

Cite this as:
Paul E. Black, "JSort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 19 January 2021. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/JSort.html