- Series: Principles of Computer Science Series
- Hardcover: 536 pages
- Publisher: W. H. Freeman (November 15, 1991)
- Language: English
- ISBN-10: 071678243X
- ISBN-13: 978-0716782438
- Product Dimensions: 9.6 x 7.5 x 1.3 inches
- Shipping Weight: 2.4 pounds
- Average Customer Review: 4.6 out of 5 stars See all reviews (7 customer reviews)
- Amazon Best Sellers Rank: #1,032,071 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your email address or mobile phone number.
Compared to What?: An Introduction to the Anaylsis of Algorithms (Principles of Computer Science Series) 0th Edition
Use the Amazon App to scan ISBNs and compare prices.
Featured Open Source Titles
Check out these featured titles from O'Reilly Media and Distributed Publishers.
Customers Who Bought This Item Also Bought
Top Customer Reviews
Reader from the Windy State
Covers surprisingly wide range of ideas from various subjects. Contains analysis, complexity theory, logic, information theory, probability and more. Don't go to the depth but gives you clear idea what is the topic about.
And I like the style book is written. It force you to read it just because it is fun even in situations I would never read serious algorithm analysis textbook.
As a student in the Computer Science major at Yale University in spring 1994, I used this textbook in Professor Michael Fischer's course, "Computer Science 365b: Design and Analysis of Algorithms."
This book was a welcome breath of fresh air compared to every other title on algorithms that I had ever seen. It described how the study of algorithms need not be daunting, by explaining that every problem at some point did not have a solution, and described in great detail the exploratory process for finding solutions for designing and analyzing algorithms.
Further, it approached the topic in a fun and humorous manner, with numerous quotations and illustrations from works by Lewis Carroll.
It proved an ideal textbook for overcoming the formidable topic of designing and analyzing algorithms for students lacking self-confidence in this topic. This textbook proved to be a key tool for conquering this required course.
Benjamin L. Russell
Rawlins accurately captures the essence of solving theoretical problems, and presents it in a way accesible to a computer science major. (Relevant at the senior or 1st year graduate level) You'll come away with less depth than the Knuth title, but much more appreciation and understanding for the How and Why of problem solving.
This book is one of the very few that survived the trip from classroom to permanent bookshelf.
Most Recent Customer Reviews
When you buy a used book there's a minimum to expect, the book was in perfect conditions, nothing to worry about it.Published on February 24, 2013 by RODRIGO NUNEZ
Excellent conversational style, but with serious and challenging exercises toward the end of each chapter. Something for all skill levels.Published on October 2, 2009 by Adam Foltzer