Module Introduction to Binary Search

Introduction to Binary Search

**Frequency: 10/10** The idea of "halving" is crucial in Computing.

Resources

- [USACO Guide: Binary search](https://usaco.guide/silver/binary-search?lang=cpp)

Problems

Binary search 2234 / 2291 800
Binary search 2 2024 / 2116 800
Binary search 3 1891 / 1946 800
Large subarray 1577 / 1707 800
Count query 1294 / 1475 800
Counting pairs 1227 / 1316 800
The k-th candy 1090 / 1147 800
Triangle edges 1045 / 1083 1000
Hamming number 762 / 883 1200
Consecutive integers 695 / 812 1300
Gnimmah distance 454 / 521 1400
Subarray 340 / 529 1400