The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. -Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game whe The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. -Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up. -Charles Long If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. -Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. -Jonathan Laventhol The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http: //msp.org
The Art of Computer Programming: Volume 3: Sorting and Searching
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. -Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game whe The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming. -Byte, September 1995 I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up. -Charles Long If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing. -Bill Gates It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers. -Jonathan Laventhol The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http: //msp.org
Compare
Josh Berry –
There are definitely sections of the book that are hard to appreciate. In that I probably did not. The majority of it is approachable and really gives an appreciation for the decisions that go into how to organize data. The section on retrieval by secondary key was a real delight. The feeling at each section of "that data structure is awesome" followed by a more apt one is impressive. Especially for how often it happens. Even seeing I was coming to the end of the book, I got used to the surprise There are definitely sections of the book that are hard to appreciate. In that I probably did not. The majority of it is approachable and really gives an appreciation for the decisions that go into how to organize data. The section on retrieval by secondary key was a real delight. The feeling at each section of "that data structure is awesome" followed by a more apt one is impressive. Especially for how often it happens. Even seeing I was coming to the end of the book, I got used to the surprise of yet another way to do things. I do hope he gets the next version out with some of the items on Persistent Data Structures out. I am not completely sold that those are necessary for most applications, but I suspect I'll be proven wrong. :)
Roger –
I felt smart having it on myshelf. I felt dumb trying to fathom it
Topilno –
Creating Web Pages for Dummies
Gaetano Venezia –
Lives up to the hype as an excellent reference book, but definitely a difficult/tedious read without a specific goal and problem in mind. Cleared up several ambiguous ideas I had about search and sort algorithms and time complexity.
Robert Fishell –
Of the first 3 volumes in this series, this is the most essential after the first. Sorting and searching are among the most important concepts programmers need to master in order to become master programmers.
Tuấn Kiệt –
nice
Ihab –
Hao Wang –
Evgeny Ogurtsov –
Yu-Han Lyu –
Selva Mariappan –
Alexander –
Hari Priya –
Manikanta –
Saptak Sengupta –
Samrat Mitra –
Adam –
Viswanath Durbha –
Ridwan Rohman –
Duncan Maccoll –
George –
Carlos Caicedo-Russi –
Willy Van den driessche –
Carl –
Athul Menon –
Wajahat Alam –
Nolvelyn –
Bogdan Petrica –
Manoj Paudel –
Aleksey –