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 791 / 807 800
Binary search 2 765 / 805 800
Binary search 3 706 / 725 800
Large subarray 591 / 655 800
Count query 495 / 597 800
Counting pairs 466 / 514 800
The k-th candy 407 / 428 800
Triangle edges 404 / 424 1000
Hamming number 279 / 346 1200
Consecutive integers 272 / 357 1300
Gnimmah distance 162 / 205 1400