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 2613 / 2677 800
Binary search 2 2366 / 2469 800
Binary search 3 2208 / 2267 800
Large subarray 1842 / 1982 800
Count query 1498 / 1697 800
Counting pairs 1392 / 1491 800
The k-th candy 1236 / 1299 800
Triangle edges 1180 / 1218 1000
Hamming number 862 / 991 1200
Consecutive integers 786 / 918 1300
Gnimmah distance 515 / 586 1400
Subarray 414 / 633 1400