(algorithm)
Definition: Insertion sort in which the proper location for the next item is found with a binary search.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 11:48:24 2004.
HTML page formatted Wed Oct 26 09:47:14 2005.
Cite this as:
Paul E. Black, "binary insertion sort", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/binaryinsort.html
