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,b340461f1683ab62 X-Google-Attributes: gid103376,public From: mheaney@ni.net (Matthew Heaney) Subject: Re: Please help! Date: 1997/10/13 Message-ID: #1/1 X-Deja-AN: 280264624 References: <343CA93E.855888D@student.hv.se> <61kn5d$pvr$1@goanna.cs.rmit.edu.au> Organization: Estormza Software Newsgroups: comp.lang.ada Date: 1997-10-13T00:00:00+00:00 List-Id: In article <61kn5d$pvr$1@goanna.cs.rmit.edu.au>, ok@goanna.cs.rmit.edu.au (Richard A. O'Keefe) wrote: >Mats Akerlund writes: > >>I need the algorithms for the Counting sort and the Adress Calculation >>sort. >>If you this algorithms or know where to find it, so please contact me. > >The algorithm can be found by using the index in your 'Data Structures >and Algorithms' textbook. If you haven't got it, the book by Cormen, >Leiserson, and Rivest is hard to beat. I kind of favor the book compared to what? an introduction to the analysis of algorithms gregory j. e. rawlins computer science press Personally, I find the CLR book to be very dry. In contrast, Rawlins is fun. -------------------------------------------------------------------- Matthew Heaney Software Development Consultant (818) 985-1271