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 2222 / 2278 800
Binary search 2 2014 / 2105 800
Binary search 3 1881 / 1935 800
Large subarray 1574 / 1703 800
Count query 1289 / 1471 800
Counting pairs 1222 / 1312 800
The k-th candy 1090 / 1147 800
Triangle edges 1043 / 1081 1000
Hamming number 760 / 883 1200
Consecutive integers 693 / 810 1300
Gnimmah distance 451 / 518 1400
Subarray 338 / 524 1400