Automotive Holiday Deals Books Gift Guide Books Gift Guide Shop Men's Athletic Shoes Learn more nav_sap_SWP_6M_fly_beacon Black Friday egg_2015 All-New Amazon Fire TV Grooming Deals Gifts Under $50 Amazon Gift Card Offer cm15 cm15 cm15 $30 Off Amazon Echo $15 Off All-New Fire Kindle Voyage Cyber Monday Video Game Deals Outdoors Gift Guide on HTL

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.

  • Apple
  • Android
  • Windows Phone
  • Android

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

7 customer reviews
ISBN-13: 978-0716782438
ISBN-10: 071678243X
Why is ISBN important?
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Have one to sell? Sell on Amazon
Buy used
Condition: Used: Acceptable
Comment: Cover shows light to moderate wear. Minimal page curling/folds/creases. *Inscribed inside front cover.*** Fast Amazon shipping, delivery tracking number, no-hassle return policy - your satisfaction is guaranteed!
Access codes and supplements are not guaranteed with used items.
20 Used from $13.07
More Buying Choices
9 New from $27.00 20 Used from $13.07 1 Collectible from $59.00
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student

Get Up to 80% Back Rent Textbooks

Special Offers and Product Promotions

  • Take an Extra 30% Off Any Book: Use promo code HOLIDAY30 at checkout to get an extra 30% off any book for a limited time. Excludes Kindle eBooks and Audible Audiobooks. Restrictions apply. Learn more | Shop now


Hero Quick Promo
Holiday Deals in Kindle Books
Save up to 85% on more than 1,000 Kindle Books. These deals are valid until November 30, 2015. Learn more

Product Details

  • 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,395,291 in Books (See Top 100 in Books)

More About the Author

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

Customer Reviews

5 star
4 star
3 star
2 star
1 star
See all 7 customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

12 of 13 people found the following review helpful By Glen Ritchie on March 30, 2000
Format: Hardcover
I am a senior in computer science & I'm taking my first course on Algorithm Analysis. Our instructor is using another book. Every year he picks a different book. I found this at our library & I've never read a computer book on this subject matter that is so useful. The theme of the book is it guides you thru "thinking about" the topic & all the other ramifications of doing things. You'll find yourself washing dishes differently after this book. Otherwise, if you looking for a better book "Introduction to Algorithms," Corman, Rivest, ..; is the definative text. And of course Knuth's monumental tome.
Reader from the Windy State
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
7 of 7 people found the following review helpful By A Customer on August 19, 1999
Format: Hardcover
I disagree with the first comment. While I know more about the algorithms and analysys than author probably expected about reader, I found the book interesting and entertaining. It forced me to think again about the old known thinks, brought me new views and new analogies between them. This is very important.
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
I strongly disagree with the first comment on this item, entitled "'Cutesy-poo' approach detracts from the content."

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
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
4 of 5 people found the following review helpful By therosen VINE VOICE on September 24, 2003
Format: Hardcover
Algorithms can be very dry and boring. Anyone who has had a boring tenured professor read directly from his textbook during class understands this.
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.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse