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 1064 / 1088 800
Binary search 2 997 / 1044 800
Binary search 3 918 / 949 800
Large subarray 745 / 831 800
Count query 613 / 729 800
Counting pairs 579 / 637 800
The k-th candy 503 / 535 800
Triangle edges 495 / 518 1000
Hamming number 342 / 422 1200
Consecutive integers 339 / 428 1300
Gnimmah distance 211 / 255 1400
Subarray 77 / 136 1400