#Upper Bound

2 notes tagged

Lower bound vs upper bound binary search explained: first index >= target vs first index > target, with ready templates in Python, Java and C++.

Find First and Last Position of a target in a sorted array (LeetCode 34) using two binary searches (lower and upper bound) in O(log n).