Fast Delivery
Multiple courier options
Rs.1,870
Rs. 2,200
15% OFF
Inclusive all taxes
This Product is out of stock
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed 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 first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called ?Divide-and-Conquer?), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.
| Author | Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein |
| Publisher | The MIT Press |
| Language | English |
| Binding Type | Paper Back |
| Main Category | Science & Mathematics |
| Sub Category | Computer Science & Application |
| ISBN13 | 9780262533058 |
| SKU | BK 0157396 |
Rs. 399
Rs. 339
15% OFF
Rs. 699
Rs. 559
20% OFF
Multiple courier options
Within 15 Days
100% Secure Payment
Within 1 Business Day