Linear Search is used to find a key number from a list of numbers. The time complexity of the algorithm is O(n). There are other algorithms which solves the problem within shorter period of time. But the advantage is that Linear Search even works with an unsorted list of numbers. So Linear Search is a very general search which can be applied on any list.
- The Algorithm will work for unsorted array of numbers.
- Linear time Complexity ( O(n) ).
Click here to download the C Program to perform Linear Search.