Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. & Stein, Clifford
List Price : US$ 79.95 Our Price : US$ 63.96
You Save 20% + FREE DELIVERY WORLDWIDE
Book ID : 43734
ISBN-10 : 81-203-4007-8 / 8120340078
ISBN-13 : 978-81-203-4007-7 / 9788120340077
of Publication :
of Publication :
Edition : (Third Edition)
Language : English
1312p., 24 cm.
This internationally acclaimed textbook provides a comprehensive introduction to the modern study of computer algorithms. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively selfcontained and presents an algorithm, a design technique, an application area, or a related topic. The algorithms are described and designed in a manner to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The third edition has been revised and updated throughout. It includes two completely new chapters, on Van Emde Boas trees and Multithreaded algorithms, and substantial additions to the chapter on recurrences (now called "Divide and Conquer"). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edgebased flow in the material on flow networks. Many new exercises and problems have been added in this edition. The text is intended primarily for students studying algorithms or data structures. As it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for selfstudy by technical professionals. "Introduction to Algorithms, the ‘bible’ of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomialtime algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on Van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance." - Daniel Spielman, Deptt. of Computer Science, Yale University About the Author Thomas H. Cormen received bachelor’s degree in Electrical Engineering from the Princeton University way back in 1978. Thereafter, he did his master’s in Electrical Engineering and Computer Science from the MIT. Among the students, he is best known for having co-authored a book titled 'Introduction to Algorithms'. In the year 2013, he published another book titled 'Algorithms Unlocked'. This book too has been received well.