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: <3178@gitpyr.gatech.EDU>
Date: Wed, 4-Mar-87 14:28:46 EST
Article-I.D.: gitpyr.3178
Posted: Wed Mar  4 14:28:46 1987
Date-Received: Fri, 6-Mar-87 06:01:34 EST
References: <814@fmsrl7.UUCP> <25183@rochester.ARPA> <25329@rochester.ARPA> <2064@cvl.umd.edu> <5608@watmath.UUCP> <2701@well.UUCP>
Reply-To: jkg@gitpyr.UUCP (Jim Greenlee)
Organization: Georgia Institute of Technology
Lines: 14
Keywords: sort, publish, papers, help
Xref: utgpu comp.edu:140 comp.lang.misc:320 comp.os.misc:51 sci.research:69

In article <2701@well.UUCP> physh@well.UUCP (Jon Foreman) writes:
>	All this talk about the best sort leads me to a question.
>Has anyone ever written a program which will unsort a dataset
>to the worst case for various types of sorts?  I'm sure this question

This is easy for Quicksort (which seems to a favorite of netters) - just sort
the dataset!

						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?!