The steps used in the implementation of Linear Search are listed as follows. The worst-case time complexity of linear search is O(n). It is widely used to search an element from the unordered list, i.e., the list in which items are not sorted. If the match is found, then the location of the item is returned otherwise, the algorithm returns NULL. 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. Linear search is also called as sequential search algorithm. So, here we will discuss the popular searching technique, i.e., Linear Search Algorithm. Two popular search methods are Linear Search and Binary Search.
If the element is present in the list, then the process is called successful, and the process returns the location of that element otherwise, the search is called unsuccessful. Searching is the process of finding some particular element in the list. In this article, we will discuss the Linear Search Algorithm.