Sequential search

Find a number by comparing from the left, one by one. Best case is 1 comparison, worst case is n, average is (n+1)/2, and the time is O(n).