Explain Sequential search method with suitable example.
Linear / Sequential Search
- In computer science, linear search or sequential search is a method for finding a particular value in a list that consists of checking every one of its elements, one at a time and in sequence, until the desired one is found.
- Linear search is the simplest search algorithm.
- It is a special case of brute-force search. Its worst case cost is proportional to the number of elements in the list.
Example of Sequential Search
