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 2187 / 2243 800
Binary search 2 1975 / 2065 800
Binary search 3 1850 / 1903 800
Large subarray 1543 / 1672 800
Count query 1260 / 1444 800
Counting pairs 1197 / 1283 800
The k-th candy 1070 / 1123 800
Triangle edges 1026 / 1065 1000
Hamming number 745 / 869 1200
Consecutive integers 684 / 802 1300
Gnimmah distance 446 / 513 1400
Subarray 332 / 515 1400