Printable View
Has anyone else read this book? I like it a lot. I recommend that everyone read this book. Does anyone have any input into this book? And might I add, Professor Knuth is a genius, this man solved so much about computer science, it is unfathomable. One of the most brilliant men ever.
Why Sorting and Searching? Isn't there a first volume of this series, where MIX is introduced? Maybe interested readers should start there.
Anyone with a computer science degree should have learned the necessary components of volume 1, such as data structures, and the fundamental components of the science of computers (assembler, math related to programming, routines, etc). Volume 2 is semi numerical algorithms (math related to programming), which I simply skipped and did not read over. Sorting and searching though, contains the heavy duty theory of algorithms, that make up the core of many (if not most) computer programs. The author estimates that most running time of computer programs is spent sorting and searching (though this book was written in the 60's, I'm sure this still holds true for the most part today).Quote:
Originally Posted by c99tutorial
I'm not saying people should skip volume 1, although they may just want to skim it if they have a CS degree. But sorting and searching is the most relevant to what those who already understand computer science need to know. Also to note, volume 4 is not complete, I think only the first half of volume 4 is done, and was only completed in 2005 by Knuth.