Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!cbatt!ihnp4!ptsfa!lll-lcc!seismo!mimsy!cvl!bhaskar
From: bhaskar@cvl.UUCP
Newsgroups: comp.edu,comp.lang.misc,comp.os.misc,sci.research
Subject: Re: Information on order(N) sort
Message-ID: <2065@cvl.umd.edu>
Date: Thu, 26-Feb-87 21:50:19 EST
Article-I.D.: cvl.2065
Posted: Thu Feb 26 21:50:19 1987
Date-Received: Sun, 1-Mar-87 08:38:03 EST
References: <814@fmsrl7.UUCP> <25183@rochester.ARPA> <25329@rochester.ARPA> <2064@cvl.umd.edu>
Organization: Center for Automation Research, Univ. of Md.
Lines: 7
Keywords: sort, publish, papers, help
Xref: utgpu comp.edu:121 comp.lang.misc:292 comp.os.misc:36 sci.research:56
Summary: Addendum

In article <2064@cvl.umd.edu>, bhaskar@cvl.umd.edu (S.K. Bhaskar) writes:
> In article <25329@rochester.ARPA>, crowl@rochester.ARPA (Lawrence Crowl) writes:
> > 
> 
> Quicksort requires atleast O(log n) space ; Bubblesort is an in-place sort.
> 
Of course, the O(log n) is in addition to the O(n) needed for the input !