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 1497 / 1534 800
Binary search 2 1367 / 1434 800
Binary search 3 1274 / 1313 800
Large subarray 1043 / 1157 800
Count query 845 / 995 800
Counting pairs 811 / 879 800
The k-th candy 706 / 747 800
Triangle edges 694 / 730 1000
Hamming number 474 / 573 1200
Consecutive integers 461 / 557 1300
Gnimmah distance 302 / 359 1400
Subarray 187 / 303 1400