Binary search works only sorted arrays. Binary search divides the given array in the middle into two halves. Hence the name binary search.

Linear search finds the target element by comparing it with all the given elements in the input array, one by one.