Introduction to Algorithms - The MIT Press (Hardback)
  • Introduction to Algorithms - The MIT Press (Hardback)

Introduction to Algorithms - The MIT Press (Hardback)

(author), (author), (author), (author)
1 Review Sign in to write a review
Hardback 1320 Pages / Published: 31/07/2009
  • In stock online
  • Free UK delivery

Usually dispatched within 24 hours

  • This item has been added to your basket
Your local Waterstones may have stock of this item. Please check by using Click & Collect
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. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.

Publisher: MIT Press Ltd
ISBN: 9780262033848
Number of pages: 1320
Weight: 2245 g
Dimensions: 229 x 203 x 51 mm
Edition: third edition

You may also be interested in...

Algorithms Unlocked
Added to basket
Matrices and Matroids for Systems Analysis
Added to basket
Purely Functional Data Structures
Added to basket
Algorithms on Trees and Graphs
Added to basket
Understanding Cryptography
Added to basket
Machine Learning
Added to basket
Added to basket
Understanding Cryptography
Added to basket

“Introduction to Algorithms”

A comprehensive book on algorithms however, disappointing to notice that Monte Carlo Simulation is not included; nor is Fast Multipole Method.

Paperback edition
Helpful? Upvote 6

Please sign in to write a review

Your review has been submitted successfully.