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 1721 / 1760 800
Binary search 2 1571 / 1640 800
Binary search 3 1473 / 1512 800
Large subarray 1225 / 1342 800
Count query 1011 / 1172 800
Counting pairs 963 / 1040 800
The k-th candy 851 / 894 800
Triangle edges 829 / 866 1000
Hamming number 586 / 695 1200
Consecutive integers 559 / 661 1300
Gnimmah distance 370 / 430 1400
Subarray 245 / 389 1400