in-place sort

(algorithm)

Definition: A sort algorithm in which the sorted items occupy the same storage as the original ones. These algorithms may use o(n) additional memory for bookkeeping, but at most a constant number of items are kept in auxiliary memory at any time.

Also known as sort in place.

Generalization (I am a kind of ...)
sort.

Specialization (... is a kind of me.)
American flag sort, quicksort, insertion sort, selection sort, Shell sort, diminishing increment sort, J sort, gnome sort.

Authors: PEB,CM

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 15 March 2004.
HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:
Paul E. Black and Conrado Martinez, "in-place sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 15 March 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/inplacesort.html