 Binary search is faster than linear search for sorted arrays except if the array is short, although the array needs to be sorted beforehand.All sorting algorithms based on comparing elements, such as quicksort and merge sort, require at least formula_151 comparisons in the worst case.Unlike linear search, binary search can be used for efficient approximate matching.