Binary search is a searching algorithm with a timecomplexity of O(LogN), it's a more faster way of searching for a value in an array. It works on only sorted arrays. Rather than eliminating one element at a time, binary search eliminate half of the remaining elements at a time and returns the index position of the value in the array. https://en.wikipedia.org/wiki/Binary_search_algorithm
Binary search is a searching algorithm with a timecomplexity of O(LogN), it's a more faster way of searching for a value in an array. It works on only sorted arrays. Rather than eliminating one element at a time, binary search eliminate half of the remaining elements at a time and returns the index position of the value in the array. https://en.wikipedia.org/wiki/Binary_search_algorithm