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: "Marin David Condic, 561.796.8997, M/S 731-93" Subject: Re: Anyone help develop an algorythm? Date: 1997/04/24 Message-ID: <97042417025012@psavax.pwfl.com>#1/1 X-Deja-AN: 237208577 Sender: Ada programming language Comments: Gated by NETNEWS@AUVM.AMERICAN.EDU X-Vms-To: SMTP%"INFO-ADA@VM1.NODAK.EDU" Newsgroups: comp.lang.ada X-Vms-Cc: CONDIC Date: 1997-04-24T00:00:00+00:00 List-Id: 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. MDC Marin David Condic, Senior Computer Engineer ATT: 561.796.8997 Pratt & Whitney, GESP Fax: 561.796.4669 West Palm Beach, FL Internet: CONDICMA@PWFL.COM =============================================================================== "A verbal contract isn't worth the paper it's written on." -- Samuel Goldwyn ===============================================================================