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: 109fba,baaf5f793d03d420 X-Google-Attributes: gid109fba,public X-Google-Thread: fc89c,97188312486d4578 X-Google-Attributes: gidfc89c,public X-Google-Thread: 1014db,6154de2e240de72a X-Google-Attributes: gid1014db,public X-Google-Thread: 103376,97188312486d4578 X-Google-Attributes: gid103376,public From: heller@utdallas.edu (Steve Heller) Subject: Re: Teaching sorts [was Re: What's the best language to start with?] Date: 1996/08/16 Message-ID: <4v2fbb$lpj@news.utdallas.edu>#1/1 X-Deja-AN: 174592197 references: <31FBC584.4188@ivic.qc.ca> <01bb83f5$923391e0$87ee6fce@timpent.airshields.com> <4uah1k$b2o@solutions.solon.com> <01bb853b$ca4c8e00$87ee6fce@timpent.airshields.com> <4udb2o$7io@solutions.solon.com> <4uvi6j$1brg@watnews1.watson.ibm.com> organization: The University of Texas at Dallas newsgroups: comp.lang.c,comp.lang.c++,comp.unix.programmer,comp.lang.ada Date: 1996-08-16T00:00:00+00:00 List-Id: ncohen@watson.ibm.com (Norman H. Cohen) wrote: >If the set of keys on the card is dense (e.g. consecutive numbers from 1 >to 60), then a radix sort (also O(n)) works nicely for 50-60 cards. >That how I sort my cancelled checks each month. I like that sort quite a bit, and have explained its close relative, distribution counting (as Knuth refers to it) both in my book on efficient programming and to my students. Interestingly enough, none of these students so far have ever heard of it, even though they are seniors in CS! Steve Heller, author and software engineer http://ourworld.compuserve.com/homepages/steve_heller