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: 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 X-Google-Thread: 109fba,baaf5f793d03d420 X-Google-Attributes: gid109fba,public From: Lawrence Kirby Subject: Re: Teaching sorts [was Re: What's the best language to start with?] Date: 1996/08/10 Message-ID: <839708378snz@genesis.demon.co.uk>#1/1 X-Deja-AN: 173418393 x-nntp-posting-host: genesis.demon.co.uk references: <31FBC584.4188@ivic.qc.ca> <01bb83f5$923391e0$87ee6fce@timpent.airshields.com> x-mail2news-path: genesis.demon.co.uk organization: none reply-to: fred@genesis.demon.co.uk newsgroups: comp.lang.c,comp.lang.c++,comp.unix.programmer,comp.lang.ada Date: 1996-08-10T00:00:00+00:00 List-Id: In article eachus@spectre.mitre.org "Robert I. Eachus" writes: > *The race really is to finish the Quicksort before the Heapsorter >has built a heap. This also shows why quicksort is quick, since the ^^^ >Quicksort step of picking up the cards is O(n), not O(n log n) ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ What does this phrase mean? Quicksort is an (n log n) (average time) operation. Building a heap is an O(n) operation. -- ----------------------------------------- Lawrence Kirby | fred@genesis.demon.co.uk Wilts, England | 70734.126@compuserve.com -----------------------------------------