Knuth, Donald Ervin : Java Glossary

go to home page K words local find full screen, hide local find menu Google search web for more information on this topic jump to foot of page translate this page with Babelfish punctuation 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z (all) ©1996-2009 Roedy Green, Canadian Mind Products
Knuth, Donald Ervin
Another name for God. Knuth has been around longer though. His series of books on algorithms and computing written back in the 1960s are still definitive. Every time I invented an incredible new algorithm, someone would point out the idea was old hat, described in a footnote somewhere in Knuth. I did finally figure out a way of doing multiprecision divide a little faster than his algorithm.
book cover recommend book⇒The Art of Computer Programming
 hardcover
ISBN13:978-0-201-48541-7impressioncounter
publisher:Addison-Wesley
published:1998-10-15
by:Donald Knuth
Knuth’s volumes 1, 2 and 3 are the reference works for standard algorithms. At his website he describes plans for volumes 4 and 5.
UK flag abe books.co.uk abe books.ca Canadian flag
UK flag amazon.co.uk. amazon.ca. Canadian flag
German flag abe books.de chapters.indigo.ca. Canadian flag
German flag amazon.de. abe books.com American flag
French flag abe books.fr amazon.com. American flag
French flag amazon.fr. barnes and noble.com American flag
Italian flag abe books.it powells.com American flag
Spanish flag iberlibro.com sony e-books American flag
Australian flag abe books anz
He also invented Web literate programming and the TEX typesetting scheme that laid the groundwork for PostScript. He is too busy working on his textbooks to accept email but you can write to him via snail mail at:
Donald E. Knuth
Professor of the Art of Computer Programming
Computer Science Dept., Gates 477
Stanford University
Stanford, CA 94305-9045
USA

Knuth’s Nostrum

Premature optimisation is the root of all evil.
~ Donald Ervin Knuth (born: 1938-01-10 age: 71)

The problem is fussing over fine detail to optimise wastes time and obscures the algorithm. Optimisation should be confined to choosing a good algorithm on the first pass. Only after the code is working should you fret over optimisation. Then, only if it needs it, determine the bottlenecks by measurement and fix only those.

Don’t do optimisations the compiler will do for you. That just clutters your code.

People often misapply the nostrum to imply that optimisation itself is evil. Only premature optimisation is.

Latex
CMP homejump to top You can get the freshest copy of this page from: or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror)
http://mindprod.com/jgloss/knuth.html J:\mindprod\jgloss\knuth.html
CMP logofeedback Please email your feedback for publication, errors, omissions, typos, formatting errors, ambiguities, unclear wording, broken/redirected link reports, suggestions to improve this page or comments to Roedy Green : feedback email
mindprod.com IP:[65.110.21.43]
view BlogYour face IP:[38.107.191.105]
You are visitor number 9,900.