Could someone help me out with the steps for proving a recursive algorithm? How does one prove the beginning case, the preservation case and the terminating case... Also, if someone gives you a recursive sorting algorithm what is the method to begin trying to determine how it works... Thanks, Luke Tuttle carnegie mellon