Introduction to Algorithms - No Cost Library

Introduction to Algorithms - 3rd Edition 

   Author(s): Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein  

        Publisher: The MIT Press, Year: 2009

                                        

 Description: 

This critically acclaimed textbook offers a detailed introduction to computer algorithms in modern analysis. It covers a wide variety of algorithms in detail, and makes their design and analysis open to readers at all levels. Each chapter is relatively self-contained and introduces an algorithm, a design technique, an field of application, or related subject matter. The algorithms are defined and structured in a way that anyone who has done a little programming can read. The explications were kept simple without compromising depth of coverage or mathematical rigour.

The third edition was revised and updated in its entirety. This includes two entirely new chapters, on Van Emde Boas trees and Multithreaded algorithms, and major additions (now called "Divide and Conquer") to the chapter on recurrences. It features improved dynamic programming and greedy algorithm treatment and a new notion of edgebased flow on flow networks in the content. This version has included lots of new exercises and problems. The text is specifically intended for students who are learning algorithms or data structures. As it addresses engineering problems in algorithm design as well as mathematical aspects, technical professionals are equally well suited for self-study.

.