Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!rutgers!ames!sdcsvax!ucsdhub!hp-sdd!hplabs!sdcrdcf!trwrb!aero!venera.isi.edu!lmiller
From: lmiller@venera.isi.edu (Larry Miller)
Newsgroups: comp.misc,comp.lang.c
Subject: Re: Fast, stable, free, small sorts?
Message-ID: <3603@venera.isi.edu>
Date: Sat, 19-Sep-87 16:33:36 EDT
Article-I.D.: venera.3603
Posted: Sat Sep 19 16:33:36 1987
Date-Received: Sun, 20-Sep-87 22:49:54 EDT
References: <460@naucse.UUCP>
Reply-To: lmiller@venera.isi.edu.UUCP (Larry Miller)
Organization: Information Sciences Institute, Univ. of So. California
Lines: 13
Xref: mnetor comp.misc:1261 comp.lang.c:4444

In article <460@naucse.UUCP> sbw@naucse.UUCP (Steve Wampler) writes:
>Can anyone point me to published/public domain stable sorting
>algorithms that are reasonably time and space efficient?

Why is STABLE necessary?  Most any NlogN routine can be written to
swap pointers rather than the data itself, so a stable routine shouldn't
be that important.  Are you looking for absolutely fastest routine?  But
that is very much data dependent.  Quick sort is not stable, but Shell sort
is, and is almost as fast for reasonable data sizes, so you might want to 
look at that.

Larry Miller
(lmiller@venera.isi.edu  --  no uucp)