Classic Algorithm Books: A review

In this section, I would like to review several algorithm books. They are:

• Algorithms (Dasgupta, Papadimitriou, and Vazirani 2008)
• Algorithm Design (Kleinberg and Tardos 2005)
• Introduction to Algorithms (Cormen et al. 2009)

Dasgupta, Papadimitriou, and Vazirani (2008) is a suitable-length book (about 300+ pages) for quickly getting to grasp the idea of algorithm design and many more philosophical understanding of a great many algorithms and techniques. While Cormen et al. (2009) is a gigantic book which includes all the algorithms of the first two books as well as carefully categorized data structures like binary trees, red-black trees and more advanced Fibonacci heaps. This book emphasizes on algorithm analysis for which it introduces several analysis techniques such as amortised analysis. Kleinberg and Tardos (2005) is a very elegant book which I think is similar to the writing philosophy of Dasgupta, Papadimitriou, and Vazirani (2008), since both of them task as example and develop realistic problems to guide the reader into thinking of delicate algorithms from simple ones.