Re: File handling question

Richard Heathfield wrote:
Joe Smith said:

<snip>

Mr. Heathfield's algorithm [...]


Um, I think it's in Knuth somewhere (although I had a look just now, and couldn't find it in TAOCP2.)

Algorithm 3.4.2R is a more general version, selecting
a sample of size n possibly greater than 1. But be sure
to read the third edition of TAOCP II; the second edition
also has an Algorithm 3.4.2R for the same purpose, but it's
a different algorithm!

--
Eric Sosman
esosman@xxxxxxxxxxxxxxxxxxx
.

Relevant Pages

  • Re: Long division algorithm
    ... Donald E Knuth. ... In the third edition, ISBN 0-201-894684-2, the relevant algorithm is on page ...
    (sci.crypt)
  • Re: array index and pointer, which is faster? - TPA
    ...      (Knuth, Donald. ... Structured Programming with go to Statements, ... And do you pray to the esteemed Mr. Knuth as well? ... whereas choosing a good algorithm from the start is ...
    (comp.lang.c)
  • Re: the failure of fractal image compression
    ... Knuth has been around longer though. ... Every time I invented an incredible new algorithm, ... He also invented Web literate programming and the TEX typesetting scheme ... Rich, my troll: You should keep to yourself when you don't know.... ...
    (sci.fractals)
  • Re: Sorting algorithm problem
    ... >> Stop bowing your head to other people and start thinking ... I developed my algorithm independent of Knuth. ...
    (comp.theory)
  • Re: Computer Science Math - For the Uninitiated
    ... their attempts to simplify their programming process(read use ... the suggestion on the Knuth books is spot on. ... on the first page of the book I am reading (The Algorithm ...
    (comp.lang.ruby)
Loading