From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,c42dbf68f5320193
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-05-02 09:16:05 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!sunqbc.risq.qc.ca!nf3.bellglobal.com!wn1feed!worldnet.att.net!204.127.198.204!attbi_feed4!attbi.com!rwcrnsc54.POSTED!not-for-mail
Message-ID: <3CD1664A.804F56BC@attbi.com>
From: Mark Biggar <mark.a.biggar@attbi.com>
X-Mailer: Mozilla 4.79 [en]C-{C-UDP; EBM-SONY1}  (Win98; U)
X-Accept-Language: en
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Generation of permutations
References: <aajce7$7jb$1@snipp.uninett.no>
 <4519e058.0204300552.15317df9@posting.google.com>
 <aam989$99c$1@nh.pace.co.uk>
 <4519e058.0205020747.11336b44@posting.google.com>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
NNTP-Posting-Host: 12.235.88.57
X-Complaints-To: abuse@attbi.com
X-Trace: rwcrnsc54 1020356164 12.235.88.57 (Thu, 02 May 2002 16:16:04 GMT)
NNTP-Posting-Date: Thu, 02 May 2002 16:16:04 GMT
Organization: AT&T Broadband
Date: Thu, 02 May 2002 16:16:04 GMT
Xref: archiver1.google.com comp.lang.ada:23420
Date: 2002-05-02T16:16:04+00:00
List-Id: <comp.lang.ada>

Ted Dennison wrote:
> 
> "Marin David Condic" <dont.bother.mcondic.auntie.spam@[acm.org> wrote in message news:<aam989$99c$1@nh.pace.co.uk>...
> > "Ted Dennison" <dennison@telepath.com> wrote in message
> > > Are you writing a bogosort?
> > I once did it for an article in "Ada Letters" called "Junk Facts And The
> > Slowsort". (My resume says that was Ada Letters, Vol 10, Num 1, if that's
> 
> I did it in Pascal for a undergraduate project back in '87. I needed
> to compare the actual running times of 3 algorithms with 3 different
> time behaviors. nlogn and n**2 were easy, but I was wracking my brain
> for a week to think up a way to sort slower than n**2.
> 
> At the time I called it "PermuteSort", but others since have named it
> "bogosort" (http://foldoc.doc.ic.ac.uk/foldoc/foldoc.cgi?query=bogosort
> ), and I like that name much better. :-)

There are worse sorts then Bogosort.  For example there is 52-pickup
sort: repeatedly randomize the list until you notice that it
is sorted.

--
Mark Biggar
mark.a.biggar@attbi.com