Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!rutgers!husc6!hao!noao!arizona!naucse!sbw
From: sbw@naucse.UUCP
Newsgroups: comp.misc,comp.lang.c
Subject: Fast, stable, free, small sorts?
Message-ID: <460@naucse.UUCP>
Date: Thu, 17-Sep-87 17:28:56 EDT
Article-I.D.: naucse.460
Posted: Thu Sep 17 17:28:56 1987
Date-Received: Sat, 19-Sep-87 10:24:01 EDT
Organization: Northern Arizona University, Flagstaff, Arizona
Lines: 18
Xref: utgpu comp.misc:1099 comp.lang.c:4209

Can anyone point me to published/public domain stable sorting
algorithms that are reasonably time and space efficient?

I have an NlogN stable sort that eats memory like cupcakes, and
a stable sort that requires only N+C memory that barely beats
a bubble sort.  Every try at something inbetween has resulted
in what I consider failure - typically exemplified by no real
gain in speed over my slow one.  I know that it can be down
in NlogN^2 time, and that Macro SPITBOL uses a stable heapsort,
but I don't want to spend anymore of my time on it.

C code would be a nice way to describe the algorithm.

Please Email me any suggestsions.

	Thanks!
	Steve Wampler
	{...!arizona!naucse!sbw}