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 766 / 783 800
Binary search 2 737 / 778 800
Binary search 3 682 / 702 800
Large subarray 572 / 635 800
Count query 467 / 568 800
Counting pairs 454 / 500 800
The k-th candy 385 / 406 800
Triangle edges 393 / 414 1000
Hamming number 263 / 326 1200
Consecutive integers 249 / 336 1300
Gnimmah distance 160 / 191 1400