Introduction to Algorithms 2nd Edition by Thomas Cormen, Charles Leiserson, Ronald Rivest and Clifford Stein
Book Description :-
The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortized analysis). Algorithms for graphing problems (used in such real-world business problems as optimizing flight schedules or flow through pipelines) come next. In each case, the authors provide the best from current research in each topic, along with sample solutions. The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage.
Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.
Book Details :-
· Hardcover: 1056 pages
· Publisher: McGraw-Hill Science/Engineering/Math; 2 edition (July 16, 2001)
· Language: English
· ISBN-10: 0070131511
· ISBN-13: 978-0070131514
· Download Link on MediaFire
· PDF (12.51MB): Download Here
· CHM (17.88MB): Download Here
0 comments:
Post a Comment