Why is Binary Search more efficient than binary search?
Binary Search on Arrays
There was a typo. I meant why is binary search more efficient than linear search?
…
binary search takes less number of comparision than linear search becuase it is base on divide an conquer approach.
the time complexity of binary search is O(Log(n) ) whereas for linear search it is O(N).