Binary Search

This lecture introduces the binary search which finds an element in a sorted array. Binary search has O(log n) time complexity. In the end, we discuss how to support both search and insertion.

Slides: https://github.com/wangshusen/AdvancedAlgorithms