Programming Books C Java PHP Python Learn more Browse Programming Books
Qty:1
  • List Price: $71.60
  • Save: $13.25 (19%)
Only 1 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
The Design and Analysis o... has been added to your Cart
Condition: Used: Good
Comment: Fast shipping from Amazon! Qualifies for Prime Shipping and FREE standard shipping for orders over $35. Overnight, 2 day and International shipping available! Excellent Customer Service.. May not include supplements such as CD, access code or DVD.
Access codes and supplements are not guaranteed with used items.
Sell yours for a Gift Card
We'll buy it for $2.00
Learn More
Trade in now
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

The Design and Analysis of Computer Algorithms Paperback – January 11, 1974

ISBN-13: 978-0201000290 ISBN-10: 0201000296 Edition: 1st

Buy New
Price: $58.35
25 New from $52.63 36 Used from $2.85 1 Collectible from $90.18
Amazon Price New from Used from
Hardcover
"Please retry"
$19.00
Paperback
"Please retry"
$58.35
$52.63 $2.85
Unknown Binding
"Please retry"
$36.79
Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Best Books of the Year
See the Best Books of 2014
Looking for something great to read? Browse our editors' picks for 2014's Best Books of the Year in fiction, nonfiction, mysteries, children's books, and much more.

Frequently Bought Together

The Design and Analysis of Computer Algorithms + Data Structures and Algorithms + Introduction to Algorithms, 3rd Edition
Price for all three: $186.39

Buy the selected items together
NO_CONTENT_IN_FEATURE

Best Books of the Year
Best Books of 2014
Looking for something great to read? Browse our editors' picks for 2014's Best Books of the Year in fiction, nonfiction, mysteries, children's books, and much more.

Product Details

  • Paperback: 470 pages
  • Publisher: Addison-Wesley; 1 edition (January 11, 1974)
  • Language: English
  • ISBN-10: 0201000296
  • ISBN-13: 978-0201000290
  • Product Dimensions: 5.8 x 1.1 x 9.1 inches
  • Shipping Weight: 1.8 pounds (View shipping rates and policies)
  • Average Customer Review: 4.6 out of 5 stars  See all reviews (14 customer reviews)
  • Amazon Best Sellers Rank: #139,336 in Books (See Top 100 in Books)

Editorial Reviews

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

Customer Reviews

Thats the reason for the 5 stars!
Ganapathy Subramaniam
The book used in my graduate Intro to Algorithms course, and I think the follow-on.
Mike W.
This one is much more formal when compared to Corman.
Rakesh

Most Helpful Customer Reviews

21 of 22 people found the following review helpful By Ganapathy Subramaniam on October 2, 2001
Format: Paperback
This is yet another classic from the Aho Gang!
It sets up a very formal framework for discussing alorithms, beginning at the beginning..an abstract mathematical model of a computer. and builds up the rest of the book using the model for implementation as well as quantification.
A solid framework for the analysis of algorithms is setup. The necessary mathematics is covered, helping in measuring an algorithm's complexity..basically the time and space complexities.
Then it goes on to deal with designing algorithms. the design methodology, with elaborate examples and exercises.
It should be admitted however that this is a solid text for the mathematically oriented. Thats the reason for the 5 stars!
If you want to go a little easy on the formalisms try
"Computer Algorithms, Pseudocode" by Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran. I found it more pragmatic.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
43 of 50 people found the following review helpful By G. Avvinti on July 16, 2002
Format: Paperback
Excluding Knuth's opera (another dimension), this (AHU) is about the other and only renowned classic algorithms book, deseverdly I'd say, together with Cormen-Leiserson-Rivest's (CLR) "Introduction to Algorithms". With the difference that the first and only edition of AHU has been written 16 years before the first (of the two) editions of CLR.
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").
Read more ›
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
6 of 6 people found the following review helpful By Mike W. on April 6, 2008
Format: Paperback
The book used in my graduate Intro to Algorithms course, and I think the follow-on. While I am obviously not as well read in this subject as many of the other reviewers, I can say "it worked", and indeed worked well. A course that has a weak text or teacher will not inspire... A-H-O/DACA and Prof. Carlson made the material exciting, even to an "architecture guy". My interests in grad school in the early 80's revolved around tessellation automata (aka systolic arrays and other highly regular compute structures) and big steaming fast computer structures. A-H-O provided me with the best understanding of the kinds of problems faced by the computers which interested me the most, and the kinds of tools needed to understand computational impact and algorithmic structuring of solutions to them. I sincerely with I hadn't lost my copy with the hundreds of annotations in the margins.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
9 of 10 people found the following review helpful By Eugene Zaikonnikov on April 19, 2002
Format: Paperback
The book elaborates thoroughly on the basics every programmer should be familiar with. If you are into software development, and have found some unfamiliar concepts in the book description - that's a sure sign that you need this book on your desk.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
4 of 4 people found the following review helpful By Rakesh on March 28, 2012
Format: Paperback
This book and Intro to Algorithms by Corman are perhaps the best 2 books in my hand. All you will ever need to form a firm foundation in algorithms are developed in these 2 books.

I had this book from way back when I was doing by Comp Sci. But recently, I lost this one during a move and had to re-order. So I though I would share my thoughts on it.

This one is much more formal when compared to Corman. However, I find it much easy to follow than Corman's. Also, I find that it becomes even better when you accompany it with some of the implementation books such as Algorithms in C etc.. It would be easier to visualize things when you accompany such a "practical" book along with this one.

TAOCP book could be another one. But I was exposed to these 2 books first before the TAOCP. I find that these 2 books put much heavy emphasize on the algorithms while the TAOCP brings in some of the other programming/dicreet math components that you study anyway in junior classes.

Draw back is that, the material is dated. Obviously, since they were published way back. So some of those optimal algorithms are not so optimal anymore. Both books lacks clear practical approach to some of those very important algorithms used today, especially on processing Graphs, Extendible Hash, Edge Detection, Concurrent Cache Oblivious B Trees etc... Concurrency is a big part of the world today. So I believe, if anyone where to make another books for academic or otherwise on algorithms, these items would be a prerequisite.

For a pure algo book on some of the core fundamental concepts, I have found much success even today with these 2 books. I don't think there are any books that can do better.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Most Recent Customer Reviews


More About the Authors

Discover books, learn about writers, read author blogs, and more.

What Other Items Do Customers Buy After Viewing This Item?