NIST

binary insertion sort

(algorithm)

Definition: Insertion sort in which the proper location for the next item is found with a binary search.

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

Author: PEB

Implementation

(C)
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 16 November 2009.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "binary insertion sort", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 16 November 2009. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/binaryinsort.html