Sequential search of an object with in an array of objects is
called as linear search.
View page
The linear search algorithm is a special case of the brute force
search.
View page
There no advantages to linear search other than searching for
the first (or last) nodes. Linear search takes linear time with an
average O(n/2) for each search.
View page
Running time of a linear search is O(n)
View page
the compexity of linear search in worst case is f(n) = n+1