A linear search algorithm is used to search a populated array for a value specified by the user. The user needs to enter the value that they would like the program to look for within the array.

Example: For an array with 16 elements, the best case scenario is that a binary search will find the element on the first go and, in the worst case, on the fourth go (2 4 = 16).