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 843 / 861 800
Binary search 2 810 / 852 800
Binary search 3 746 / 765 800
Large subarray 617 / 684 800
Count query 514 / 620 800
Counting pairs 485 / 539 800
The k-th candy 422 / 444 800
Triangle edges 414 / 437 1000
Hamming number 286 / 354 1200
Consecutive integers 282 / 369 1300
Gnimmah distance 181 / 219 1400
Subarray 11 / 34 1400