lt1g+@andrew.cmu.edu (Luke David Tuttle) (11/19/90)
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
hls@rwthbs.uucp (H.L. Stahl) (11/26/90)
In article <gbFoE6K00Uh_M2e0ki@andrew.cmu.edu> lt1g+@andrew.cmu.edu (Luke David Tuttle) writes: >Could someone help me out with the steps for proving a recursive algorithm? >... >Also, if someone gives you a recursive sorting algorithm what is the >method to begin trying to determine how it works... The method is simply "complete induction" ... | _ : Hans-Ludwig Stahl, Lehrstuhl fuer Betriebssysteme, RWTH Aachen |_|_`__ : Kopernikusstr. 16, D-5100 Aachen, ..49-(0)241-804374 | |__) : Domain: hls@informatik.rwth-aachen.de |__) : uucp: ...!{seismo,mcvax,uunet}!unido!rwthinf!hls