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 1491 / 1528 800
Binary search 2 1361 / 1428 800
Binary search 3 1267 / 1306 800
Large subarray 1039 / 1153 800
Count query 842 / 992 800
Counting pairs 808 / 877 800
The k-th candy 702 / 743 800
Triangle edges 690 / 726 1000
Hamming number 470 / 568 1200
Consecutive integers 459 / 555 1300
Gnimmah distance 299 / 356 1400
Subarray 187 / 301 1400