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 1530 / 1569 800
Binary search 2 1400 / 1469 800
Binary search 3 1306 / 1347 800
Large subarray 1072 / 1189 800
Count query 870 / 1023 800
Counting pairs 833 / 904 800
The k-th candy 729 / 770 800
Triangle edges 719 / 755 1000
Hamming number 493 / 591 1200
Consecutive integers 478 / 574 1300
Gnimmah distance 313 / 371 1400
Subarray 200 / 316 1400