Path: utzoo!utgpu!attcan!uunet!steinmetz!davidsen
From: davidsen@steinmetz.ge.com (William E. Davidsen Jr)
Newsgroups: comp.lang.c
Subject: Re: Sorting algorithms...
Message-ID: <11898@steinmetz.ge.com>
Date: 18 Aug 88 16:59:17 GMT
References: <8808171405.AA05232@ucbvax.Berkeley.EDU>
Reply-To: davidsen@crdos1.UUCP (bill davidsen)
Organization: General Electric CRD, Schenectady, NY
Lines: 16

I have a C program which will allow generation of data initialized in a
number of configurations, allows vector length to be set, and sorts with
any of 11 algorithms giving the CPU time. It optionally will give the
number of compares and moves.

One of the best places to get sorting info is Knuth, _Art of Computer
Programming_ vol 3 (Sorting and Searching). There is a discussion of
many of the common algorithms, including merge.

If you really want to see the program I can mail it. I have no
documentation, and was using it just to investigate why some sorts work
better than others.
-- 
	bill davidsen		(wedu@ge-crd.arpa)
  {uunet | philabs | seismo}!steinmetz!crdos1!davidsen
"Stupidity, like virtue, is its own reward" -me