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=0.2 required=5.0 tests=BAYES_00,INVALID_MSGID, REPLYTO_WITHOUT_TO_CC 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: 10db24,4cf070091283b555 X-Google-Attributes: gid10db24,public X-Google-Thread: 103376,97188312486d4578 X-Google-Attributes: gid103376,public From: Lawrence Kirby Subject: Re: What's the best language to learn? [was Re: Should I learn C or Pascal?] Date: 1996/08/20 Message-ID: <840560210snz@genesis.demon.co.uk>#1/1 X-Deja-AN: 175348763 x-nntp-posting-host: genesis.demon.co.uk references: x-mail2news-path: genesis.demon.co.uk organization: none reply-to: fred@genesis.demon.co.uk newsgroups: comp.edu,comp.lang.ada,comp.lang.c,comp.lang.c++,comp.unix.programmer Date: 1996-08-20T00:00:00+00:00 List-Id: In article dewar@cs.nyu.edu "Robert Dewar" writes: >What on earth is a "list qiucksort". It is a quicksort algorithm for lists. Partitioning implements very easily on lists. > As soon as you are not trying to do >things in place, why on earth would you use quicksort, when mergesort is >obviosuly as efficient and has a worst case performance of NlogN. I agree and I was in no way advocating the use of list quicksorts; I was simply pointing out that the best way to quicksort a pack of cards equates most closely to a list quicksort. In place algorithms don't tend to work well on cards (larger constant factor in the individual operations). -- ----------------------------------------- Lawrence Kirby | fred@genesis.demon.co.uk Wilts, England | 70734.126@compuserve.com -----------------------------------------