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

Gregory J. E. Rawlins

Computer Science Press, 1992 - Computers - 536 pages

What people are saying

User Review -

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.  

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

User Review  - Yvette Zárate - Goodreads

Quite possibly my favorite textbook & class in college. Thanks, Dr. Summers.

About the author

Rawlins is Associate Professor of Computer Science at Indiana University, Bloomington.

Bibliographic information

• Title: Compared to What?: An Introduction to the Analysis of Algorithms; Principles of computer science series, ISSN 0888-2096
• Author: Gregory J. E. Rawlins
• Edition: illustrated
• Publisher: Computer Science Press, 1992
• ISBN: 071678243X, 9780716782438
• Length: 536 pages
• Subjects: Computers / Computer Science; Computers / Programming / Algorithms