| ||||||||||||||||||
 Trade In this Item for up to £13.60
Trade in The Design and Analysis of Computer Algorithms (Series in Computer Science & Information Processing) for an Amazon.co.uk gift card of up to £13.60, which you can then spend on millions of items across the site. Plus, get an extra £5 when you trade in books worth £10 or more until June 30, 2012. Trade-in values may vary (terms apply). Find more products eligible for trade-in.
|
Frequently Bought Together
Product details
|
More About the Author
Product Description
Product Description
The Design and Analysis of Computer Algorithms introduces the basic data structures and programming techniques often used in efficient algorithms. It covers the use of lists, push-down stacks, queues, trees, and graphs.
From the Back Cover
With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter.
0201000296B04062001
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product)
|
Sell a Digital Version of This Book in the Kindle Store
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
The two books are quite different in the language and formalism used: more formal and mathematical inclined AHU with respect to CLR. I'd say, the very classic style of his authors who have made history in the CS literature with their books (particularly 2 on algorithms and data structures, 2 on Computer Theory, 2 on Compilers, 1 on CS foundations): as these books have been used in most universities around the world for decades, they've proved to be real milestones in the education of thousands of students.
The books differ also in scope, since AHU is certainly not an encyclopedic collection as CLR does, with his roughly 500 pages against 1000. In spite of this, I'd point out the following: my textbook on Algorithms was CLR, but when we got to Complexity Classes (P-NP and theory behind) we "had" to switch to AHU for the simple reason that CLR did not almost mention at all Turing Machines nor Space Complexity, without which is certainly possible to learn e.g. about NP-TIME completeness, but without which, such a path would equally certainly miss some foundamental topics of Complexity Theory.
All in all, then, imo the book truly deserves 5 stars (and perhaps it would deserve a second, updated, edition too ... possibly, imho, through a bit less revolutionary revision job than they did with "Introduction to Automata Theory, Language and Computation").
As a final note, those looking for a more applicative and self-reference than an educational introductory text, could have a look at the two-volumes opera by the former Knuth's pupil, Robert Sedgewick (possibly the more consolidated C or C++ versions).
Listmania!
|
|
Look for similar items by category
Look for similar items by subject
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
|
