Intro. To Algorithms, 3/e
Intro. To Algorithms, 3/e
Couldn't load pickup availability
Important Details
Our delivery time will be between 48hs to 72hs, except for remote areas that might take longer. Contact us to establish the exact delivery time frame expectation.
Next day delivery from Monday to Saturday will be possible (as long as your order is placed the day before 5pm).
We do not collect or deliver on Sundays.
Our books are both: Pre-loved and new, we do not segregate them.
To offer a more affordable experience, we have created a universal price range
Our pre-loved books' condition is generally immaculate.
* Preloved books might include slight paper colour variations, spine creases, small writings or highlights, and generally minor flaws that do not hinder the reading experience.
* Book covers may differ from the copy you receive; however, all books are original editions with complete content. We always try our best to provide the correct cover image.
* If you want to be sure about a specific book edition or translation, contact us before you place your order.
Share

The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow. 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.
Dimensions:216 x 32
Author: Cormen | Al. Et
ISBN: 9788120340077
Format: paperback
Pages 1312
Shipping, Tracking & Support - Once your order has been shipped, you will receive a tracking number via email. To Track your order using First Flight Click here.
To know more about shipping rates, delivery areas, and timeline Click here.
Do you want to know more about our refund and return policy ? Click here.
All prices and charges include 5% tax.
We are here to enhance your online experience, so please let us know how we can improve our services; your opinion matters to us.