Linear Search algorithm with its Implementation in C++

Linear search is used on a collection of items. It relies on the technique of traversing a list from start to end by exploring properties of all the elements that are found on the way.


  • Take a collection of elements and let k (have the value to be searched for).
  • Now traverse (go through all the elements) the collection and check whether that element is equal to k or not.
    • If equal then print "Found" and break the loop.
    • Else go till the last element and if not found then print "Not Found".
Example: Taking an array of 9 elements and searching for 4 in it.

Time Complexity
  • In this, in the worst case, we will be going to all the elements.
  • Hence the complexity is O(n) where n-number of elements in a collection.
Below is the implementation of a linear search in C++.

If you have some content OR material related to this OR there is an error then do share them through the comment section for which we will be thankful to you.

Thank You for Reading