- Hardcover: 1202 pages
- Publisher: The MIT Press; 2 edition (Sep 1 2001)
- Language: English
- ISBN-10: 0262032937
- ISBN-13: 978-0262032933
- Product Dimensions: 23.1 x 20.6 x 5.1 cm
- Shipping Weight: 2.1 Kg
- Average Customer Review: 3.9 out of 5 stars See all reviews (44 customer reviews)
-
Amazon Bestsellers Rank:
#92,083 in Books (See Top 100 in Books)
- #11 in Books > Computers & Internet > Programming > Java > Beginner's Guides
- See Complete Table of Contents
|
||||||||||||||||||
|
||||||||||||||||||
|
||||||||||||||||||
|
There is a newer edition of this item:
|
Product Details |
Product Description
From Amazon
Aimed at any serious programmer or computer science student, the new second edition of Introduction to Algorithms builds on the tradition of the original with a truly magisterial guide to the world of algorithms. Clearly presented, mathematically rigorous, and yet approachable even for the maths-averse, this title sets a high standard for a textbook and reference to the best algorithms for solving a wide range of computing problems.
With sample problems and mathematical proofs demonstrating the correctness of each algorithm, this book is ideal as a textbook for classroom study, but its reach doesn't end there. The authors do a fine job at explaining each algorithm. (Reference sections on basic mathematical notation will help readers bridge the gap, but it will help to have some maths background to appreciate the full achievement of this handsome hardcover volume.) Every algorithm is presented in pseudo-code, which can be implemented in any computer language, including C/C++ and Java. This ecumenical approach is one of the book's strengths. When it comes to sorting and common data structures, from basic linked list to trees (including binary trees, red-black and B-trees), this title really shines with clear diagrams that show algorithms in operation. Even if you glance over the mathematical notation here, you can definitely benefit from this text in other ways.
The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortised analysis). Algorithms for graphing problems (used in such real-world business problems as optimising flight schedules or flow through pipelines) come next. In each case, the authors provide the best from current research in each topic, along with sample solutions.
This text closes with a grab bag of useful algorithms including matrix operations and linear programming, evaluating polynomials and the well-known Fast Fourier Transformation (FFT) (useful in signal processing and engineering). Final sections on "NP-complete" problems, like the well-known traveloling salesmen problem, show off that while not all problems have a demonstrably final and best answer, algorithms that generate acceptable approximate solutions can still be used to generate useful, real-world answers.
Throughout this text, the authors anchor their discussion of algorithms with current examples drawn from molecular biology (like the Human Genome project), business, and engineering. Each section ends with short discussions of related historical material often discussing original research in each area of algorithms. In all, they argue successfully that algorithms are a "technology" just like hardware and software that can be used to write better software that does more with better performance. Along with classic books on algorithms (like Donald Knuth's three-volume set, The Art of Computer Programming), this title sets a new standard for compiling the best research in algorithms. For any experienced developer, regardless of their chosen language, this text deserves a close look for extending the range and performance of real-world software. --Richard Dragan
Book Description
The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers.
There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms 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 the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.
There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms 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 the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.
Inside This Book
(Learn More)
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most helpful customer reviews
5 of 5 people found the following review helpful
5.0 out of 5 stars
THE book to introduce algorithms,
By
Ce commentaire est de: Introduction to Algorithms, Second Edition (Hardcover)
You shouldn't have to read this review... this book is unmatched in it's field - it's a great book for someone with no background in algorithms to start learning. The exercises are very interesting with some being more mathematical while others are thought provoking extensions to material covered in the book. It's easily the bible in this field. After this one can go on to more advanced specialized material like Papadimitriou, Motwani and Raghavan etc. If you don't have this book and you work with ANY kind of algorithms or do any kind of programming, you owe it to yourself to get it.
3 of 3 people found the following review helpful
4.0 out of 5 stars
Good general book,
By A Customer
Ce commentaire est de: Introduction to Algorithms, Second Edition (Hardcover)
Pros: - Good general book for basic algorithm stuff. Cons:- - I don't consider it a good idea to write algorithms with index starting from 1 instead of 0? Most popular languages used in the industry, have arrays starting from zero. - Most professors that I have discussed it with agree that this is not the best book for the subject but probably the only one with this much material in it.
3.0 out of 5 stars
Average Book,
By
Ce commentaire est de: Introduction to Algorithms, Second Edition (Hardcover)
A decent book in regards to theory and explanations...though, lack of solutions for certain problems which would be beneficial for learning the concepts.
Share your thoughts with other customers: Create your own review
Want to see more reviews on this item?
|
Most recent customer reviews |
Listmania!
Look for similar items by category
- Books > Computers & Internet > Computer Science
- Books > Computers & Internet > Operating Systems
- Books > Computers & Internet > Programming > Algorithms
- Books > Computers & Internet > Programming > Java > Beginner's Guides
- Books > New & Used Textbooks > Computer Science & Information Systems > Algorithms
- Books > New & Used Textbooks > Computer Science & Information Systems > Computer Science
- Books > Professional & Technical > Professional Science > Mathematics
- Books > Qualifying Textbooks - Fall 2007 > Computers & Internet
- Books > Qualifying Textbooks - Fall 2007 > Science
- Books > Science > Mathematics
Look for similar items by subject
Feedback
Would you like to update product info or give feedback on images?
