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 2088 / 2137 800
Binary search 2 1899 / 1984 800
Binary search 3 1773 / 1823 800
Large subarray 1484 / 1609 800
Count query 1213 / 1397 800
Counting pairs 1147 / 1231 800
The k-th candy 1026 / 1080 800
Triangle edges 977 / 1016 1000
Hamming number 709 / 835 1200
Consecutive integers 658 / 773 1300
Gnimmah distance 426 / 488 1400
Subarray 310 / 491 1400