Class BinarySearch<T>

Binary Search algorithm Binary search is an efficient algorithm for finding an item from a sorted list of items. It works by repeatedly dividing in half the portion of the list that could contain the item.

Time Complexity: O(log n) Space Complexity: O(1) for iterative, O(log n) for recursive

Example

const arr = [1, 2, 3, 4, 5, 6, 7, 8, 9];
BinarySearch.search(arr, 5); // returns 4 (index)
BinarySearch.search(arr, 10); // returns -1 (not found)
Copy

Example

const bs = new BinarySearch([1, 2, 3, 4, 5]);
bs.search(3); // returns 2 (index)
Copy