(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, Carleton University.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 September 2007.
HTML page formatted Mon Sep 17 08:45:22 2007.
Cite this as:
Paul E. Black, "JSort", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 September 2007. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/JSort.html
