7 elements will be compared to find 25 using linear search
What is linear search?
A linear search, also known as a sequential search, is a technique used in computer science to locate an element inside a list.
Up until a match is discovered or the entire list has been searched, each element of the list is successively checked.
In worst-case linear time, a linear search performs at most n comparisons, where n is the length of the list.
A linear search has an average case of n+1/2 comparisons if each element is equally likely to be searched, but the average case can be impacted if the search probability for each element differ.
Since other search algorithms and schemes, such the binary search algorithm and hash tables, provide substantially faster searching for all but short lists, linear search is rarely practical.
To learn more about linear search with the given link
