Glossary: Data Structures and Algorithms in C++

std::lower_bound

Also written: lower_bound, std::upper_bound, upper_bound

A tested O(log n) binary search that returns an iterator to where a value would go in a sorted vector, at its first copy if present. upper_bound returns the position after any copies.