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 1160 / 1191 800
Binary search 2 1069 / 1127 800
Binary search 3 994 / 1026 800
Large subarray 803 / 900 800
Count query 662 / 781 800
Counting pairs 625 / 683 800
The k-th candy 547 / 580 800
Triangle edges 539 / 566 1000
Hamming number 362 / 450 1200
Consecutive integers 364 / 455 1300
Gnimmah distance 226 / 275 1400
Subarray 98 / 164 1400