24.4.3 Searching Algorithms (cont.)

There are algorithms that produce set union, intersection, and difference for sorted sequences
Other algorithms search for special values:
- adjacent_find - finds first element equal to element immediately following
- search - finds a subsequence in a larger sequence
- equal - returns true if corresponding elements in 2 sequences of similar size are equal
- mismatch - takes a pair of similar sequences, returns pair of iterators that indicate the first positions where sequences differ