COS 554 SPRING 2009 HW #7  DUE THURSDAY 4/2/09
p. 259: 12.2-1, 15 points
p. 260: 12.2-4, 10 points
p. 268: 12.4-3, 10 points
p. 287: 13.3-3, 10 points
p. 293: 13.4-3, 15 points
p. 310: 14.2-2, 20 points
p. 317: 14.3-4, 20 points
********** Problem Notes *********,
I want you to write two programs for this homework.

First, for Problem 12.2-1, write a program that takes a sequence and 
determines whether that sequence is a possible search sequence for the 
last element in the sequence. Your program should work for any sequence of 
integers and be able to correctly classify the examples in Problem 12.2-1.

Second, write a program to implement the algorithm that solves problem 
14.3-4.