Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!usc!wuarchive!mit-eddie!uw-beaver!cornell!rochester!pt.cs.cmu.edu!o.gp.cs.cmu.edu!andrew.cmu.edu!lt1g+
From: lt1g+@andrew.cmu.edu (Luke David Tuttle)
Newsgroups: comp.lang.c
Subject: Proving Algorithims
Message-ID: <gbFoE6K00Uh_M2e0ki@andrew.cmu.edu>
Date: 19 Nov 90 02:31:34 GMT
Organization: Carnegie Mellon, Pittsburgh, PA
Lines: 12

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