15% Off Today Only. Get the code »

Introduction to Algorithms

by

2 Customer Reviews
Introduction to Algorithms - Cormen, Thomas H, and Leiserson, Charles E, and Rivest, Ronald L
Browse related Subjects
+ Browse All Subjects

Introduction to Algorithms is a comprehensive and fully understandable introduction to the study of algorithms that makes it suitable for use as a text, handbook or general reference.

Introduction to Algorithms 2009, MIT Press (MA), Cambridge

ISBN-13: 9780262033848

3rd edition

Hardcover

Select 		Introduction to Algorithms 2009, Mit Press, Cambridge

ISBN-13: 9780262533058

3rd edition

Trade paperback

Select
Introduction to Algorithms 2001, McGraw-Hill Science/Engineering/Math

ISBN-13: 9780070131514

2nd edition

Hardcover

Select 		Introduction to Algorithms 2001, MIT Press (MA), Cambridge, MA

ISBN-13: 9780262032933

2nd edition

Hardcover

Select
Introduction to Algorithms 2001, MIT Press (MA), Cambridge, Mass

ISBN-13: 9780262531962

2nd Student edition

Trade paperback

Select 		Introduction to Algorithms 1990, MIT Press (MA), Cambridge, MA

ISBN-13: 9780262031417

Hardcover

Select
Introduction to Algorithms 1990, MIT Press (MA)

ISBN-13: 9780262530910

Trade paperback

Select

All Editions of Introduction to Algorithms

Introduction to Algorithms

2009, Hardcover

ISBN-13:

9780262033848

Introduction to Algorithms

2009, Trade paperback

ISBN-13:

9780262533058

Introduction to Algorithms

2001, Hardcover

ISBN-13:

9780070131514

Introduction to Algorithms

2001, Hardcover

ISBN-13:

9780262032933

Introduction to Algorithms

2001, Trade paperback

ISBN-13:

9780262531962

Introduction to Algorithms

1990, Hardcover

ISBN-13:

9780262031417

Introduction to Algorithms

1990, Trade paperback

ISBN-13:

9780262530910

Books by Thomas H Cormen

Related Books

Customer Reviews

Write a Review

Gerry

Nov 12, 2014

The "bible" for algorithms

I have taught or taken three Algorithms courses from this same text and not covered everything in it. This is a great text for a first introduction into algorithms for undergraduates, a great text for a number of different upper level/graduate courses, and a great reference for the professional.

The subject matter is well chosen, well organized, and extremely well presented. The material is hard. There is no way around the fact that any introduction to algorithms will cause you to stretch your brain, but CLR presents everything in a clear way that you can follow.

The exercises progress from reasonable to very difficult. The more difficult exercises sometime include as much learning as the text. If you ever use this book, go to Cormen's website for an explanation of his bad jokes. This stuff is much easier if you can keep your sense of humor.

Lastly, the pseudo code is presented in a consistent matter as is the nomenclature. Apparently the pseudo code is presented so well that some of the IEEE publications are considering making CLR pseudo code the standard for publication.

If this sounds like a glowing fan letter, it is. Buy this book. Buy it in hard cover because it is NOT going to go out of style.

PS: Buy the third edition. Some chapters are very much clearer than in the second edition. I have both but never even open my second edition.

1 Silent Rating

See All Customer Reviews

Terms of Use | Privacy Policy | Recommendations by Simularity | Copyright © 1998 - 2017 Alibris. All rights reserved.

Alibris, the Alibris logo, and Alibris.com are registered trademarks of Alibris, Inc.

Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited, Baker & Taylor, Inc., or by their respective licensors, or by the publishers, or by their respective licensors. For personal use only. All rights reserved. All rights in images of books or other publications are reserved by the original copyright holders.