Proving Algorithims

[H.L. Stahl]

In article <gbFoE6K00Uh_M2e0ki at andrew.cmu.edu> lt1g+ at 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 at informatik.rwth-aachen.de
     |__)  : uucp:    ...!{seismo,mcvax,uunet}!unido!rwthinf!hls