BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Introduction to Algorithms, 3rd Edition (Mit Press)

Introduction to Algorithms, 3rd Edition (Mit Press)

Introduction to Algorithms, 3rd Edition (Mit Press)
Stock photo: cover may vary

Introduction to Algorithms, 3rd Edition (Mit Press) Hardback - 2009

by Cormen, Thomas H

Add to wish list
This seller has earned a 5.00 of 5 Stars rating from internet customers.
  • Used
  • Hardback
Used: Good

Description

MIT Press, 2009-09-01. 3rd. hardcover. Used: Good. 3.00x12.00x9.00. Buy with confidence. Excellent Customer Service & Return policy.
Ask the seller a question Add to wish list
A$44.30
Free Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Dropship order
Ships from Ergodebooks (Texas, United States)

Details

  • Title Introduction to Algorithms, 3rd Edition (Mit Press)
  • Author Cormen, Thomas H
  • Binding Hardback
  • Edition 3rd
  • Condition Used: Good
  • Pages 1312
  • Volumes 1
  • Language ENG
  • Publisher MIT Press, Cambridge, MA
  • Publication date 2009-09-01
  • Illustrated Yes
  • Bookseller's Inventory # SONG0262033844
  • ISBN 9780262033848 / 0262033844
  • Weight 5.01 lbs (2.27 kg)
  • Dimensions 9.36 x 8.33 x 2.09 in (23.77 x 21.16 x 5.31 cm)
  • Size 3.00x12.00x9.00
  • Age range 18 to UP years
  • Grade levels 13 - UP
  • Category Computers - Languages / Programming
  • Library of Congress subjects Computer programming, Computer algorithms
  • Library of Congress Catalogue Number 2009008593
  • Dewey Decimal Code 005.1
  • Quantity available 1

About Ergodebooks Texas, United States

Biblio member since 2005

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Summary

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.

Reader reviews for Introduction to Algorithms, 3rd Edition (Mit Press)

From the publisher

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.

About the author

Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009).

Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.

Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology.

Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.

tracking-