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
Data structure basics:
1. Array, vector, and list: https://youtu.be/Ign3VHqNybs
2. Binary search: https://youtu.be/yfHcb1hXt3s
3. Skip list: https://youtu.be/UGaOXaXAM5M
