ConceptTheory & Algos
Binary insertion sort
An algorithm that uses binary search to find the correct position for insertion in insertion sort, reducing comparison cost to .
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.