The Art of Computer Programming, Volume 1: Fundamental Algorithms (Art of Computer Programming)
At first, I enjoyed this dense and scholarly volume. Knuth's dry humor is peppered throughout the book, but pops up most frequently in the first few chapters. It seemed at odds with the negative (and adoring) opinions I'd read about the book.I was told (by Knuth in his introduction) that I could skip as much of the math as I liked. So I dutifully skimmed through the math chapter and continued.Then I hit MIX. It's the theoretical computer to which all of the program examples in the book will be
Quite incredible. Took me a very long time to finish, but was absolutely worth it. Truly the gold standard for algorithm analysis.
Essential reading for study of algorithms.
An excellent learning resource for anyone with an interest in computers or mathematics. Not exactly a light read, but it provides a great set of tools that can be applied to many situations. The problem sets were concise, interesting and a far better substitute to doing sudokus on the morning commute. I tried to work through all the problems rated 25 or less, while glancing at the more complex/time consuming ones, but I sometimes lacked the skills to complete a problem. I would like to revisit
This book outlines the design of computers and shows how many of the challenges of programming development have been addressed. It is a great and foundational computer science book. Today, understanding the operation of the processor is less critical and the way data structures are used has somewhat evolved. The math and assembly programs gave critical insight into practice and optimization at one time, however are less relevant now. Programmers who read it will still love this book.It was a
Donald Ervin Knuth
Hardcover | Pages: 672 pages Rating: 4.37 | 1691 Users | 43 Reviews
Present Based On Books The Art of Computer Programming, Volume 1: Fundamental Algorithms (Art of Computer Programming)
Title | : | The Art of Computer Programming, Volume 1: Fundamental Algorithms (Art of Computer Programming) |
Author | : | Donald Ervin Knuth |
Book Format | : | Hardcover |
Book Edition | : | Third Edition |
Pages | : | Pages: 672 pages |
Published | : | July 17th 1997 by Addison-Wesley (first published January 1st 1973) |
Categories | : | Computer Science. Programming. Science. Nonfiction. Technology. Computers. Technical |
Description During Books The Art of Computer Programming, Volume 1: Fundamental Algorithms (Art of Computer Programming)
The first revision of this third volume is the most comprehensivesurvey of classical computer techniques for sorting and searching. It extends thetreatment of data structures in Volume 1 to consider both large and smalldatabases and internal and external memories. The book contains a selection ofcarefully checked computer methods, with a quantitative analysis of theirefficiency. Outstanding features of the second edition include a revised sectionon optimum sorting and new discussions of the theory of permutations and ofuniversal hashing.Itemize Books Conducive To The Art of Computer Programming, Volume 1: Fundamental Algorithms (Art of Computer Programming)
Original Title: | Art of Computer Programming, Volume 1: Fundamental Algorithms |
ISBN: | 0201896834 (ISBN13: 9780201896831) |
Edition Language: | English |
Series: | Art of Computer Programming |
Rating Based On Books The Art of Computer Programming, Volume 1: Fundamental Algorithms (Art of Computer Programming)
Ratings: 4.37 From 1691 Users | 43 ReviewsWrite Up Based On Books The Art of Computer Programming, Volume 1: Fundamental Algorithms (Art of Computer Programming)
Reading this book once is not enough. It's an amazing piece that everyone should read, or at least skim through. There are so great tips and insights I've never seen elsewhere, and reading the whole thing just opens up your mind to a lot of things.At first, I enjoyed this dense and scholarly volume. Knuth's dry humor is peppered throughout the book, but pops up most frequently in the first few chapters. It seemed at odds with the negative (and adoring) opinions I'd read about the book.I was told (by Knuth in his introduction) that I could skip as much of the math as I liked. So I dutifully skimmed through the math chapter and continued.Then I hit MIX. It's the theoretical computer to which all of the program examples in the book will be
Quite incredible. Took me a very long time to finish, but was absolutely worth it. Truly the gold standard for algorithm analysis.
Essential reading for study of algorithms.
An excellent learning resource for anyone with an interest in computers or mathematics. Not exactly a light read, but it provides a great set of tools that can be applied to many situations. The problem sets were concise, interesting and a far better substitute to doing sudokus on the morning commute. I tried to work through all the problems rated 25 or less, while glancing at the more complex/time consuming ones, but I sometimes lacked the skills to complete a problem. I would like to revisit
This book outlines the design of computers and shows how many of the challenges of programming development have been addressed. It is a great and foundational computer science book. Today, understanding the operation of the processor is less critical and the way data structures are used has somewhat evolved. The math and assembly programs gave critical insight into practice and optimization at one time, however are less relevant now. Programmers who read it will still love this book.It was a
0 comments:
Post a Comment
Note: Only a member of this blog may post a comment.