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 1669 / 1707 800
Binary search 2 1522 / 1593 800
Binary search 3 1429 / 1466 800
Large subarray 1188 / 1304 800
Count query 974 / 1131 800
Counting pairs 927 / 1002 800
The k-th candy 821 / 863 800
Triangle edges 798 / 834 1000
Hamming number 562 / 667 1200
Consecutive integers 538 / 639 1300
Gnimmah distance 357 / 415 1400
Subarray 232 / 375 1400