I read Knuth's Volume 3, Searching and Sorting back in the 70's when I was a new grad student, it's great. I now own the second and latest edition of this volu

I read Knuth's Volume 3, Searching and Sorting back in the 70's when I was a new grad student, it's great. I now own the second and latest edition of this volume, but it is now over 20 years old. I recommend all of Knuth's publications. Is Search and Sorting dated? Well, it is quite old. The fold out chart of tape merging patterns for different tape based sorting algorithms doesn't really come up very often anymore. It's been over 40 years since I've had to write programs that worked with mainframe tape drives. Although AVL trees are covered well, there is no coverage of red-black trees or splay-trees. Hashing is covered extensively, but there is no discussion of more modern hash table methods (like Cuckoo Hashing or Robin Hood Hashing or the power of choice results). Furthermore, the basic hardware model used by Knuth in volume 3 assumes uniform costs for memory access. Cache sensitive algorithms aren't considered in volume 3 but are very important today. Even quicksort, which I learned by studying Volume 3, now has what I consider to be a more modern treatment in Sedgewick and Wayne's Algorithms, 4th Ed.