Binary Search in Top-Bottom algorithm.
repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise, narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.
// Recursive implementationexport const binarySearch = <T>(arr: Array<T>, target: T) => {let start = 0,end = arr.length - 1,middle = Math.floor((start + end) / 2);while (arr[middle] !== target && start <= end) {if (arr[middle] > target) {end = middle - 1;} else {start = middle + 1;}middle = Math.floor((start + end) / 2);}return arr[middle] === target ? middle : -1;};
| Worst Time Complexity | Average Time Complexity | Best Time Complexity | Space Complexity |
|---|---|---|---|
| O(log n ) | O(log n) | O(1) | O(1) |