Simplest-shop.com

     

online shopping, the simple way

Welcome | Help
Search for
in
Home > Books > Subjects > Computers & Internet > Computer Science > Introduction Algorithms
This website will be shutdown on 2008-04-01.
my cart Add to shopping cart

Introduction to Algorithms

 Rating 4
enlarged image: Introduction to Algorithms
enlarge imageEnlarge image
80% Recommended by our customers.
Publisher: The MIT Press
Catalog: Book
Release date: 2001-09-01
Media: Hardcover
Number of pages: 1184
Ean: 9780262032933
Book Isbn: 0262032937
tip Tip: compare prices with similar books

Authors:
Thomas H. Cormensee more Books by Thomas H. Cormen
Charles E. Leisersonsee more Books by Charles E. Leiserson
Ronald L. Rivestsee more Books by Ronald L. Rivest
Clifford Steinsee more Books by Clifford Stein

Top stores Description Price Link to shop
amazon.com Availability: in 24 hours
Current discount:30% off !!!
$58.90
used23 used offers, as low as...$45.99see more used offers
all new32 thirdParty new offers, as low as...$45.00see more ThirdParty new offers

User Reviews:
 Rating 5   Written on June 3, 2007
   Summary: Fantastic algorithms book
This is one of the few books that I've kept from my undergrad days as a computer science major. Although I haven't been doing software development in a while, I still use it for reference once in a while. It's easy to understand and timeless reference book. I work for a large DoD company and quite a few of my co-workers have this book on their shelves as well. (We all went to different colleges.)

 Rating 5   Written on April 19, 2007
   Summary: Good Reference, Poor Textbook
This is a good reference for researchers, but it is not suitable for beginners. For anyone who try to study algorithms in the beginning, he just needs the big picture of this course, but this book contains too many mathematical proofs. In other words, the beginners just want a cup of milk, but the authors of this book give them a whole cow.

Although this book is quite huge, it does not contain some important topics, like online algorithms, randomized algorithms ... etc. In fact, this book should try to 'lose its weight' in order to get more useful knowledge.

The book contains a lot of interesting exercises, but does not indicate any hints or solutions. In fact, some of those exercises are too hard for students, and the authors should try to announce all sloutions in the website.


 Rating 2   Written on March 1, 2007
   Summary: Too much and too little
+ Defacto standard
+ Accompanying WebCourse

- Too deep if used as an intro book; lacks solutions if used for a reference book
- It's HUGE!; hard to carry around

= Tries to appease too wide an audience. Definately attractive to professors who already know the information and feel this is THE book yet probably too deep for an intro algorithms class. Wish there was a searchable pdf version that came with the book on a CD as well as odd numbered solutions.


 Rating 4   Written on February 11, 2007
   Summary: Great book with one major shortcoming
What it is:
A very thick text book about a) the mathematics behind algorithms, and b) a treasure chest of random performance tips.

Who it's for:
This book is for those who want or need to gain a decent grasp of the math for analyzing algorithms, and already have a decent understanding of discrete mathematics and probability.

What's good about it:
I really like this book. It's very high quality, well written, concise, and clear, and it's sprinkled with clever little tips to improve the efficiency of common routines.

Tips:
You can watch video recordings of the MIT lectures based on the book. Check out "6.046J Introduction to Algorithms" by searching for "ocw 6.046J" in your favorite search engine. The mathematical prerequisite course is also available in text form on MIT's OpenCourseWare; it can be found by searching for "ocw 6.042J spring 2005".

Warnings:
* Don't bother with this book unless you have a high aptitude for math
* Don't bother with this book unless you're prepared to work at it
* It's not designed as a reference book; instead it's a study book.

Many reviewers have called this book a "reference", but I have to disagree. A good reference book makes information quickly accessible, but this book would require you to read way too much to be called a reference. A practical reference book for algorithms is "The Algorithm Design Manual" by Steven S. Skiena, assuming you don't require proofs.

The Major Shortcoming!
Given that the book's design is most appropriate for learning things you don't already know, it has one major shortcoming: there are no answers to any of the exercises or problems. That makes the book semi-useless for self-study as well as for instructors who believe in the pedagogic value of students being able to check their answers. The instructor's manual is only available to instructors on the condition that they don't make the answers available.


 Rating 5   Written on February 10, 2007
   Summary: Great text, great reference
The de facto standard for many algorithms courses. It's a great text with well-structured proofs, examples and exercises. It's also a great reference that I constantly find on the shelves of co-workers. Definitely a keeper that will come in handy for years to come.

Definitely not for those without a strong discrete math background. This book gives you the foundations and not just code.

Cheaper than the bookstores as always.

Comparison map
Wondering how the book "Introduction to Algorithms" relates to similar books? Find out at a glance here:
Price comparison Introduction to Algorithms
Introduction to Algorithms
Artificial Intelligence: A Modern Approach (2nd Edition) (Prentice Hall Series in Artificial Intelligence)
Artificial Intelligence: A Modern Approach (2nd...
Introduction to the Theory of Computation, Second Edition
Introduction to the Theory of Computation, Second...
Operating System Concepts (7th Edition)
Operating System Concepts (7th Edition)
Computer Organization and Design: The Hardware/Software Interface. Third Edition, Revised
Computer Organization and Design: The...
Design Patterns: Elements of Reusable Object-Oriented Software (Addison-Wesley Professional Computing Series)
Design Patterns: Elements of Reusable...
Our price$58.90$98.40$119.16$103.16$58.45$41.57
List price$85.00$123.00$148.95-$64.95$59.99
Lowest used price$45.99$50.00$50.00$27.99$41.28$31.99
Lowest new price$45.00$56.00$50.00$59.99$44.97$36.89
CatalogBookBookBookBookBookBook
Release date2001-09-012002-12-302005-02-152004-12-142007-06-011994-11-10
MediaHardcoverHardcoverHardcoverHardcoverPaperbackHardcover
Number of pages11841132456944621416
Ean978026203293397801379039559780534950972978047169466397801237060659780201633610
Book Isbn026203293701379039520534950973047169466501237060680201633612
Upc-----785342633610
Link to shop*
(opens in a new window)
BUY IT NOW*BUY IT NOW*BUY IT NOW*BUY IT NOW*BUY IT NOW*BUY IT NOW*
take one out?

I am here:
Home > Books > Subjects > Computers & Internet > Computer Science > Introduction Algorithms
This website will be shutdown on 2008-04-01.

tell a friend about this pageE-mail this page

 
About the Simplest Shop | Help | Term of Use | Privacy Policy
Home | Contact us | Bookmark us | get paid for writing
Copyright Simplest-Shop.com 2004. All rights reserved