Linear search is also called as sequential search algorithm.
It is the simplest searching algorithm. In Linear search, we simply traverse the list
completely and match each element of the list with the item whose location is to be found.
If the match is found, then the location of the item is returned; otherwise, the algorithm returns NULL.
Binary Search is a searching algorithm for finding an element's position in a sorted array.
In this approach, the element is always searched in the middle of a portion of an array.
Binary search is faster than linear search. In case of binary search, array elements must be in ascending order.