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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,50880f040eb869b4 X-Google-Attributes: gid103376,public From: NKSW39B@prodigy.com (Matthew Givens) Subject: Re: Anyone help develop an algorythm? Date: 1997/04/28 Message-ID: <5k14l6$264i@newssvr01-int.news.prodigy.com>#1/1 X-Deja-AN: 237832300 Distribution: world References: <97042417025012@psavax.pwfl.com> Organization: Prodigy Services Company 1-800-PRODIGY Newsgroups: comp.lang.ada Date: 1997-04-28T00:00:00+00:00 List-Id: "Marin David Condic, 561.796.8997, M/S 731-93" wrote: > >Joel VanLaven writes: >>Note that selection sort (still O(N^2)) is much better than bubble sort >>and is "just as simple". It would also be easy to apply to your >>situation (as the primary sort). Basically, if you are really using >>bubble sort, almost anything at all would be better. Of course it might >>be that you are not using what I call a buuble sort. >> > Of course, an alternate strategy is to always start development > using the Slowsort(1) algorithm. Moving to almost anything > else (including bubble sort) gets you an immediate improvement in > performance and much customer satisfaction ;-)) > > (1) Slowsort is an algorithm developed by myself & Bob Zaret in > which you generate a random permutation of the list, then check to > see if the list is sorted. If not, do it again... Behavior is > O(N!). It was written up in Ada Letters many moons ago. Interesting. I developed that one myself (in C) back in 1991. Well, you know what they say about great minds... - If at first you don't succeed, destroy all evidence that you ever tried. << Iceman >>