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 1279 / 1309 800
Binary search 2 1176 / 1241 800
Binary search 3 1093 / 1129 800
Large subarray 895 / 998 800
Count query 727 / 857 800
Counting pairs 696 / 762 800
The k-th candy 592 / 627 800
Triangle edges 584 / 614 1000
Hamming number 396 / 484 1200
Consecutive integers 382 / 475 1300
Gnimmah distance 243 / 294 1400
Subarray 124 / 209 1400