What is a linear search?

A linear search is a straightforward searching technique that examines each element in a list sequentially until it finds the target item or reaches the end of the list. This method begins at the first item and checks each subsequent item one by one, making it very intuitive and easy to implement.

The main characteristic of a linear search is that it does not require the list to be sorted beforehand, which allows it to be used with any type of data structure. While this technique is simple and functional, it can be inefficient for large lists, as its time complexity is O(n), meaning that, in the worst-case scenario, it will check every single item in the list.

This method contrasts with other searching techniques like binary search, which can only be applied to sorted lists and operates by dividing the list in half repeatedly to determine where the target item might reside.