R-alpha: Sorting Efficiency -- A bit of humour...
Apropos sorting, I stumbled across this one a moment ago: From: rjd4@cam.ac.uk (Bob Dowling) Subject: Re: Sorting algorithms (was Re: Whoo hoo) Newsgroups: alt.sysadmin.recovery Date: 5 Sep 1997 09:19:21 GMT This talk of sorting algorithms brings me back to one of my favourite interview questions, designed to see if the candidate is on the ball. "Sketch out a program that takes a random permutation of the numbers from 1 to 1000 and prints them in order." Any mention of sorting algorithms is regarded as a "fail" on this question, of course. - - Bob Dowling: UNIX Support, University of Cambridge Computing Service, rjd4@cam.ac.uk New Museums Site, Pembroke Street, Cambridge, UK. CB2 3QG. +44 1223 334728 http://www-uxsup.csx.cam.ac.uk/ -------- Those who do not learn from Dilbert are doomed to repeat it. --------
O__ ---- Peter Dalgaard Blegdamsvej 3 c/ /'_ --- Dept. of Biostatistics 2200 Cph. N (*) \(*) -- University of Copenhagen Denmark Ph: (+45) 35327918 ~~~~~~~~~~ - (p.dalgaard@biostat.ku.dk) FAX: (+45) 35327907 =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- r-devel mailing list -- Read http://www.ci.tuwien.ac.at/~hornik/R/R-FAQ.html Send "info", "help", or "[un]subscribe" (in the "body", not the subject !) To: r-devel-request@stat.math.ethz.ch =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-