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 2197 / 2253 800
Binary search 2 1989 / 2078 800
Binary search 3 1861 / 1914 800
Large subarray 1551 / 1682 800
Count query 1270 / 1454 800
Counting pairs 1206 / 1292 800
The k-th candy 1077 / 1132 800
Triangle edges 1028 / 1067 1000
Hamming number 750 / 872 1200
Consecutive integers 686 / 804 1300
Gnimmah distance 447 / 514 1400
Subarray 335 / 518 1400