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 1664 / 1702 800
Binary search 2 1517 / 1588 800
Binary search 3 1423 / 1460 800
Large subarray 1179 / 1298 800
Count query 965 / 1122 800
Counting pairs 921 / 997 800
The k-th candy 814 / 856 800
Triangle edges 793 / 829 1000
Hamming number 556 / 662 1200
Consecutive integers 535 / 634 1300
Gnimmah distance 354 / 412 1400
Subarray 229 / 370 1400