Linear Search

Linear search, also called sequential search, is a method for finding an element within a list by checking each element in sequence until a match is found or the whole list has been searched. It runs in linear time in the worst case, making at most n comparisons on a list of length n, and needs no precondition on how the list is ordered, unlike faster searches such as binary search that require a sorted list. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/