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

Front Cover
Computer Science Press, 1992 - Computers - 536 pages
1 Review
Each chapter focuses on a basic programming problem and works through a variety of options for its solution, thus covering the essentials, incorporating pedagogical material, and giving students the experience of analysis. Math concepts are explained in the appendices. Annotation copyright by Book News, Inc., Portland, OR

What people are saying - Write a review

User Review - Flag as inappropriate

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.

Other editions - View all

Bibliographic information