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 1303 / 1335 800
Binary search 2 1198 / 1263 800
Binary search 3 1112 / 1150 800
Large subarray 914 / 1018 800
Count query 741 / 873 800
Counting pairs 710 / 775 800
The k-th candy 610 / 645 800
Triangle edges 598 / 630 1000
Hamming number 408 / 497 1200
Consecutive integers 391 / 486 1300
Gnimmah distance 251 / 302 1400
Subarray 131 / 224 1400