Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!cbatt!gatech!gitpyr!jkg
From: jkg@gitpyr.UUCP
Newsgroups: comp.edu,comp.lang.misc,comp.os.misc,sci.research
Subject: Re: Information on order(N) sort
Message-ID: <3156@gitpyr.gatech.EDU>
Date: Sat, 28-Feb-87 11:12:14 EST
Article-I.D.: gitpyr.3156
Posted: Sat Feb 28 11:12:14 1987
Date-Received: Sun, 1-Mar-87 13:32:03 EST
References: <814@fmsrl7.UUCP> <25183@rochester.ARPA> <25329@rochester.ARPA> <2064@cvl.umd.edu>
Reply-To: jkg@gitpyr.UUCP (Jim Greenlee)
Organization: Georgia Institute of Technology
Lines: 14
Keywords: sort, publish, papers, help
Xref: utgpu comp.edu:124 comp.lang.misc:298 comp.os.misc:39 sci.research:59

In article <2064@cvl.umd.edu> bhaskar@cvl.umd.edu (S.K. Bhaskar) writes:
>Quicksort requires atleast O(log n) space ; Bubblesort is an in-place sort.
>Also, Quicksort is O(n log n ) only in the average. The worst case is still
>O(n^2).

Why not use Heapsort? It is O(nlogn) in both the worst and average cases.
It also sorts in place.

						Jim Greenlee
-- 
The Shadow...!{akgua,allegra,amd,hplabs,ihnp4,seismo,ut-ngp}!gatech!gitpyr!jkg

Jryy, abj lbh'ir tbar naq qbar vg! Whfg unq gb xrrc svqqyvat jvgu vg hagvy lbh
oebxr vg, qvqa'g lbh?!