Binary Search is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity.
| Time Complexity: | 0 ( log n ) | ||
|---|---|---|---|