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 583 / 594 800
Binary search 2 571 / 602 800
Binary search 3 530 / 545 800
Large subarray 444 / 493 800
Count query 359 / 430 800
Counting pairs 350 / 392 800
The k-th candy 292 / 305 800
Triangle edges 300 / 316 1000
Hamming number 206 / 258 1200
Consecutive integers 196 / 264 1300
Gnimmah distance 120 / 140 1400