How do we construct the algorithm?
// return value i that satisfies: 0<=i<=b.length,
// (i = b.length or x=b[i])
public static int linearSearch (int [ ] b, int x)
Need a loop. It will compare elements of b with x, beginning with b[0], b[1], �
Invariant: 0<=i<=b.length and x not in b[0..i-1]