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 ...)
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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 29 September 2014.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "JSort", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 29 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/JSort.html