A binary search employs a divide and conquer strategy to find the position of a target value in a sorted list. Also known as a half-interval search, logarithmic search, or binary chop.
🔔 Complexity is considered in terms of worst case.
| Notes | |
|---|---|
| Θ(log n) |
| Notes | |
|---|---|
| Θ(1) | Requires three pointers to the list elements, regardless of list size |