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 942 / 965 800
Binary search 2 882 / 925 800
Binary search 3 808 / 835 800
Large subarray 663 / 738 800
Count query 547 / 656 800
Counting pairs 519 / 577 800
The k-th candy 452 / 479 800
Triangle edges 442 / 465 1000
Hamming number 309 / 382 1200
Consecutive integers 305 / 394 1300
Gnimmah distance 191 / 234 1400
Subarray 44 / 85 1400