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: 10f6aa,e1e578817780dac2 X-Google-Attributes: gid10f6aa,public 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: djohnson@tartarus.ucsd.edu (Darin Johnson) Subject: Re: Should I learn C or Pascal? Date: 1996/08/13 Message-ID: #1/1 X-Deja-AN: 173950166 sender: djohnson@tartarus.ucsd.edu references: <4u7hi6$s2b@nntp.seflin.lib.fl.us> <4uo74j$95p@ns.broadvision.com> organization: UCSD Computer Science and Engineering Department newsgroups: comp.lang.c,comp.lang.c++,comp.unix.programmer,comp.lang.ada,comp.os.msdos.programmer Date: 1996-08-13T00:00:00+00:00 List-Id: > A binary sort, also known as quicksort, or Hoare's sort is covered extensively > in Knuth's volume three (from 1971) and in every undergraduate data structure > and algorithm course in the world;)...you would expect anyone with a CS degree > to be familiar with it. Actually, I learned it freshman year, but didn't understand it. Entire new concepts of programming were still trying to find niches in my head, leaving no room for understanding what was going on with quicksort. Most later classes assumed I already knew it. I did get clued into it later on, but I think many of my classmates kept the "quicksort is the fastest sort" categorization without really understanding it. Too many people fall asleep in algorithms class (then bitch about the waste of time later). -- Darin Johnson djohnson@ucsd.edu O- - I'm not a well adjusted person, but I play one on the net.