Compared to What?: An Introduction to the Anaylsis of Algorithms

By Gregory J.E. Rawlins

Book Overview

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... This description may be from another edition of this product.

• Format: Hardcover
• Language: English
• ISBN: 071678243X
• ISBN13: 9780716782438
• Release Date: November 1991
• Publisher: W. H. Freeman
• Length: 536 Pages
• Weight: 2.60 lbs.
• Dimensions: 9.5" x 1.3" x 7.5"

Customer Reviews

An approachable and entertaining introduction to the design and analysis of algorithms.

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

Making algorithms interesting

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.

Best Book on A. Analysis

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

Good book

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.