Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!cbatt!gatech!lll-lcc!seismo!rochester!crowl
From: crowl@rochester.UUCP
Newsgroups: comp.edu,comp.lang.misc,comp.os.misc,sci.research
Subject: Re: Information on order(N) sort
Message-ID: <25329@rochester.ARPA>
Date: Thu, 26-Feb-87 20:09:03 EST
Article-I.D.: rocheste.25329
Posted: Thu Feb 26 20:09:03 1987
Date-Received: Sat, 28-Feb-87 06:38:30 EST
References: <814@fmsrl7.UUCP> <25183@rochester.ARPA> <561@aw.sei.cmu.edu.sei.cmu.edu> <1080@hounx.UUCP>
Reply-To: crowl@rochester.UUCP (Lawrence Crowl)
Distribution: world
Organization: U of Rochester, CS Dept, Rochester, NY
Lines: 11
Keywords: sort, publish, papers, help
Xref: utgpu comp.edu:119 comp.lang.misc:286 comp.os.misc:34 sci.research:54

In article <1080@hounx.UUCP> kort@hounx.UUCP (B.KORT) 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 quicksort is an inplace O(n log n) sort while the bubble sort is O(n^2).
The quicksort will provide much better performance for the same space.  That
is unless you are worried about program space.
-- 
  Lawrence Crowl		716-275-5766	University of Rochester
			crowl@rochester.arpa	Computer Science Department
 ...!{allegra,decvax,seismo}!rochester!crowl	Rochester, New York,  14627