Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!usc!apple!snorkelwacker.mit.edu!bloom-beacon!eru!hagbard!sunic!mcsun!unido!rwthinf!rwthbs!hls
From: hls@rwthbs.uucp (H.L. Stahl)
Newsgroups: comp.lang.c
Subject: Re: Proving Algorithims
Message-ID: <1990Nov26.072205.24989@rwthbs.uucp>
Date: 26 Nov 90 07:22:05 GMT
References: <gbFoE6K00Uh_M2e0ki@andrew.cmu.edu>
Reply-To: hls@rwthbs.UUCP (Hans-Ludwig Stahl)
Organization: Lehrstuhl fuer Betriebssysteme, RWTH Aachen
Lines: 13

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