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 1610 / 1648 800
Binary search 2 1470 / 1541 800
Binary search 3 1374 / 1413 800
Large subarray 1132 / 1249 800
Count query 925 / 1080 800
Counting pairs 884 / 957 800
The k-th candy 782 / 824 800
Triangle edges 764 / 800 1000
Hamming number 528 / 630 1200
Consecutive integers 506 / 605 1300
Gnimmah distance 335 / 393 1400
Subarray 217 / 350 1400