Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!husc6!linus!philabs!pwa-b!mmintl!franka
From: franka@mmintl.UUCP (Frank Adams)
Newsgroups: comp.misc,comp.lang.c
Subject: Re: Fast, stable, free, small sorts?
Message-ID: <2399@mmintl.UUCP>
Date: Mon, 21-Sep-87 19:02:38 EDT
Article-I.D.: mmintl.2399
Posted: Mon Sep 21 19:02:38 1987
Date-Received: Fri, 25-Sep-87 06:11:04 EDT
References: <460@naucse.UUCP> <1719@ho95e.ATT.COM>
Reply-To: franka@mmintl.UUCP (Frank Adams)
Organization: Multimate International, E. Hartford, CT.
Lines: 9
Xref: mnetor comp.misc:1288 comp.lang.c:4492

In article <1719@ho95e.ATT.COM> wcs@ho95e.UUCP (46133-Bill.Stewart,2G218,x0705,) writes:
>If memory serves me correctly, isn't the Shell sort stable?

No, it isn't.  The best O(n log n) stable sort I know of requires O(n)
additional memory.
-- 

Frank Adams                           ihnp4!philabs!pwa-b!mmintl!franka
Ashton-Tate          52 Oakland Ave North         E. Hartford, CT 06108