Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!cbatt!ihnp4!ptsfa!lll-lcc!styx!ames!rutgers!princeton!allegra!alice!ark
From: ark@alice.UUCP
Newsgroups: comp.edu,comp.lang.misc,comp.os.misc,sci.research
Subject: Re: Information on order(N) sort
Message-ID: <6670@alice.uUCp>
Date: Fri, 27-Feb-87 17:07:13 EST
Article-I.D.: alice.6670
Posted: Fri Feb 27 17:07:13 1987
Date-Received: Sun, 1-Mar-87 15:05:36 EST
References: <814@fmsrl7.UUCP> <25183@rochester.ARPA> <1080@hounx.UUCP>
Organization: AT&T Bell Laboratories, Liberty Corner NJ
Lines: 7
Keywords: sort, publish, papers, help
Xref: utgpu comp.edu:126 comp.lang.misc:300 comp.os.misc:41 sci.research:61

In article <1080@hounx.UUCP>, kort@hounx.UUCP writes:
> If you're short on memory, the bubble sort, slow and humble as it is,
> will get the job done.  It uses lots of pair-wise comparisons.

The Shell sort is much faster and uses no more memory.
It is typically O(n**1.4); the bubble sort is O(n**2).
It isn't much longer to code, either.