Daily bit(e) of C++ | std::equal_range
Daily bit(e) of C++ ♻️1, The binary search algorithm that returns both the lower and upper bound for a given value: std::equal_range.
The std::equal_range algorithm is a binary search algorithm (2*logn comparisons) that operates on sorted ranges.
It returns the lower and upper bounds for the given value, effectively denoting the range of elements that equal the value.
Same as std::lower_bound and std::upper_bound, std::equal_range still provides O(logn) number of comparisons on non-random-access ranges.
