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 08:47:56 PST Path: archiver1.google.com!postnews1.google.com!not-for-mail From: dennison@telepath.com (Ted Dennison) Newsgroups: comp.lang.ada Subject: Re: Generation of permutations Date: 2 May 2002 08:47:56 -0700 Organization: http://groups.google.com/ Message-ID: <4519e058.0205020747.11336b44@posting.google.com> References: <4519e058.0204300552.15317df9@posting.google.com> NNTP-Posting-Host: 65.115.221.98 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 8bit X-Trace: posting.google.com 1020354476 15837 127.0.0.1 (2 May 2002 15:47:56 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: 2 May 2002 15:47:56 GMT Xref: archiver1.google.com comp.lang.ada:23414 Date: 2002-05-02T15:47:56+00:00 List-Id: "Marin David Condic" wrote in message news:... > "Ted Dennison" 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. :-) -- T.E.D. Home - mailto:dennison@telepath.com (Yahoo: Ted_Dennison) Homepage - http://www.telepath.com/dennison/Ted/TED.html