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 2064 / 2111 800
Binary search 2 1877 / 1961 800
Binary search 3 1757 / 1806 800
Large subarray 1470 / 1597 800
Count query 1202 / 1387 800
Counting pairs 1133 / 1216 800
The k-th candy 1014 / 1068 800
Triangle edges 963 / 1002 1000
Hamming number 701 / 824 1200
Consecutive integers 651 / 767 1300
Gnimmah distance 421 / 484 1400
Subarray 305 / 483 1400