Binary Search
3 programs — patterns, complexity, and code
| # | Program Name | Pattern | Time | Space | Key Idea | Level |
|---|---|---|---|---|---|---|
| 1 | binarySearch | Binary Search | O(log n) | O(1) | Halve the search space each step; move left or right pointer past mid. | Simple |
| 2 | searchInRotatedArray | Binary Search | O(log n) | O(1) | One half is always sorted; determine which half and narrow search accordingly. | Middle |
| 3 | findMinRotatedArray | Binary Search | O(log n) | O(1) | If mid > right, min is in right half; otherwise it is in left half including mid. | Middle |