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: fc89c,97188312486d4578 X-Google-Attributes: gidfc89c,public X-Google-Thread: 109fba,baaf5f793d03d420 X-Google-Attributes: gid109fba,public X-Google-Thread: 1014db,6154de2e240de72a X-Google-Attributes: gid1014db,public X-Google-Thread: 103376,97188312486d4578 X-Google-Attributes: gid103376,public From: dik@cwi.nl (Dik T. Winter) Subject: Re: Teaching sorts [was Re: What's the best language to start with?] Date: 1996/08/16 Message-ID: #1/1 X-Deja-AN: 174450289 sender: news@cwi.nl (The Daily Dross) references: organization: CWI, Amsterdam newsgroups: comp.lang.c,comp.lang.c++,comp.unix.programmer,comp.lang.ada Date: 1996-08-16T00:00:00+00:00 List-Id: In article dewar@cs.nyu.edu (Robert Dewar) writes: > A bubble sort is certainly a > much simpler solution to the problem of optimal sorting of a sorted > list, and simplicity of solutoins is interesting if performance is NOT > an issue after all. Indeed. I once used it in an algorithm that calculated the singular values of a matrix. At the end the values were sorted with a bubble sort. Why not? The most expensive (n^3) part had been done. And it was only a few lines of code in a routine that was already very complex. Think about adding a heapsort or quicksort within (and think about the overhead when most likely the maximum number of elements to be sorted was around 20). -- dik t. winter, cwi, kruislaan 413, 1098 sj amsterdam, nederland, +31205924098 home: bovenover 215, 1025 jn amsterdam, nederland; http://www.cwi.nl/~dik/