home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.c++
- Path: sparky!uunet!usc!cs.utexas.edu!sun-barr!ames!purdue!yuma!sailors
- From: sailors@CS.ColoState.EDU (robert sailors)
- Subject: Re: New Employee Test
- Sender: news@yuma.ACNS.ColoState.EDU (News Account)
- Message-ID: <Nov21.193415.44805@yuma.ACNS.ColoState.EDU>
- Date: Sat, 21 Nov 1992 19:34:15 GMT
- References: <assist.721943530@orion.oac.uci.edu> <1992Nov19.002724.13837@en.ecn.purdue.edu> <1992Nov19.010534.19506@cs.yale.edu>
- Nntp-Posting-Host: beethoven.cs.colostate.edu
- Organization: Colorado State University, Computer Science Department
- Lines: 14
-
- In article <1992Nov19.010534.19506@cs.yale.edu> rescorla@rtnmr.chem.yale.edu (Eric Rescorla) writes:
- >In article <1992Nov19.002724.13837@en.ecn.purdue.edu> krauskop@en.ecn.purdue.edu (Curtis D Krauskopf) writes:
- >>Suggestions that a quicksort or other algorithm be used (especially
- >>since quicksort is a standard library function) get many bonus points.
- >be heapsort, as far as I can tell.
- >
- >Also, I'd note that you specified that the guy should create a bubble
- >sort. One might believe that you had a specific reason why you wanted
- >that. I certainly wouldn't tell someone who was writing code for me
-
- So, the best bonus question might be, "Excuse me sir/Ma'am, do you have a
- good reason to use the bubble sort? I could maybe make a faster one, if you
- want."
-
-