×

Linear search

Sorting algorithm
In computer science, linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched. Wikipedia
Worst-case complexity: O(n)
Average complexity: O(n)
Best-case performance: O(1)