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 2055 / 2101 800
Binary search 2 1872 / 1955 800
Binary search 3 1752 / 1801 800
Large subarray 1460 / 1587 800
Count query 1195 / 1379 800
Counting pairs 1126 / 1210 800
The k-th candy 1012 / 1066 800
Triangle edges 960 / 999 1000
Hamming number 699 / 822 1200
Consecutive integers 650 / 764 1300
Gnimmah distance 421 / 484 1400
Subarray 304 / 480 1400