Compared to What?: An Introduction to the Anaylsis of Algorithms (Principles of Computer Science Series) [Hardcover]

Gregory J.E. Rawlins (Author)

Book Description

Publication Date: November 15, 1991 | ISBN-10: 071678243X | ISBN-13: 978-0716782438

compared to what? covers all the basics of algorithm analysis but it does not just supply algorithms to memorize - it lets you guide your students through the process of breaking down and solving aigolithmic problems. The invaluable analytic skills developed through this innovative approach will appiv to anj, programming assignment-no matter the size of the problem or the language and macnine used. The book does not assume a high degree of familiarity with discrete mathematics-in fact, all mathematical concepts crucial to algorithm analysis are explained in the appendices. Each chapter centers on a basic problem and works through a variety of available . options for its solution rather than declaring a single best answer. Within the chapters, carefully orchestrated. 'Pauses'-helpful questions and strategy suggestions-point students to workable solutions and to increasinglv more advanced variations and applications. End-of-chapter 'Codas' restate each chapter's major themes and guide the transition into the next set of problems. Compared to What? will help students analyze problems, determine what needs to be optimized, and pinpoint inefficiencies and inaccuracies in their programs. Its fr-iendlv but challenging style, inventive examples 'and analogies, descriptions of state-of-the-art applications, and pragmatic focus will help you teach students to create algorithmic solutions-not merely memorize them.

Product Details

• Hardcover: 536 pages
• Publisher: W. H. Freeman (November 15, 1991)
• Language: English
• ISBN-10: 071678243X
• ISBN-13: 978-0716782438
• Product Dimensions: 9.2 x 7.6 x 1.4 inches
• Shipping Weight: 2.4 pounds
• Average Customer Review: 4.5 out of 5 stars  See all reviews (6 customer reviews)
• Amazon Best Sellers Rank: #469,857 in Books (See Top 100 in Books)

More About the Author

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

Customer Reviews

Most Helpful Customer Reviews

7 of 7 people found the following review helpful:

5.0 out of 5 stars Good book, August 19, 1999

By A Customer

This review is from: Compared to What?: An Introduction to the Anaylsis of Algorithms (Principles of Computer Science Series) (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.

6 of 7 people found the following review helpful:

5.0 out of 5 stars Best Book on A. Analysis, March 30, 2000

By 

Glen Ritchie (Fargo, ND) - See all my reviews

This review is from: Compared to What?: An Introduction to the Anaylsis of Algorithms (Principles of Computer Science Series) (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

2 of 2 people found the following review helpful:

5.0 out of 5 stars An approachable and entertaining introduction to the design and analysis of algorithms., May 11, 2006

By 

Benjamin L. Russell "Aspiring Researcher of P... (Tokyo, Japan) - See all my reviews
(REAL NAME)   

This review is from: Compared to What?: An Introduction to the Anaylsis of Algorithms (Principles of Computer Science Series) (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