Lower/Upper Bound

Medium

Lower/Upper Bound

Lower Bound finds the first position >= target, Upper Bound finds the first position > target using binary search.

📊 Complexity

Type	Value
Best	O(1)
Average	O(log n)
Worst	O(log n)
Space	O(1)

🏷️ Tags

SearchBinary SearchBoundO(log n)

📖 Introduction

Lower Bound and Upper Bound are binary search variants that find "boundaries" of a specific value in a sorted array. Especially useful when there are duplicates.

1/11

🔍Lower Bound Search

Find the first position where value >= 30 in a sorted array using binary search.

Lower/Upper Bound

Medium

Lower/Upper Bound

Lower Bound finds the first position >= target, Upper Bound finds the first position > target using binary search.

📊 Complexity

Type	Value
Best	O(1)
Average	O(log n)
Worst	O(log n)
Space	O(1)

🏷️ Tags

SearchBinary SearchBoundO(log n)

📖 Introduction

Lower Bound and Upper Bound are binary search variants that find "boundaries" of a specific value in a sorted array. Especially useful when there are duplicates.

1/11

🔍Lower Bound Search

Find the first position where value >= 30 in a sorted array using binary search.

🔍Lower Bound Search