## 24.4.3 Searching Algorithms - `binary_search`, `upper_bound`, `lower_bound`

- Operate on sorted sequences
- `binary_search` returns `true` if key is found
- `lower_bound` returns iterator where key can be inserted
  - The first element larger than or equal to value, or
  - The ending iterator
- `upper_bound` locates the first element strictly larger than the key
- Subrange indicated by these 2 values describes subsequence containing the key

prev |top |next