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 12 February 2019.
HTML page formatted Tue Feb 12 10:57:42 2019.

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