Write an algorithm called SortedSequentialSearch that will return the same results as SequentialSearch but will run more quickly because it can stop with a failure the moment it finds that the target is smaller than the current list value.

When you write your algorithm, use the Compare(x,y) function:

Compare(x,y) = {-1 if x < y , 0 if x = y, 1 if x > y )

Do an analysis of the worst case, average case with the target found. And average case with the target not found.