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.
 |
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now |
Book Description
Product Details
Would you like to update product info or give feedback on images? |
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
Share your thoughts with other customers
Most Helpful Customer Reviews
7 of 7 people found the following review helpful
By A Customer
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.
7 of 8 people found the following review helpful
By Glen Ritchie
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
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
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
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
Most Recent Customer Reviews
5.0 out of 5 stars
Pretty good for an used book
When you buy a used book there's a minimum to expect, the book was in perfect conditions, nothing to worry about it.
Published 2 months ago by RODRIGO NUNEZ
5.0 out of 5 stars
Cheery but heavy
Excellent conversational style, but with serious and challenging exercises toward the end of each chapter. Something for all skill levels.
Published on October 2, 2009 by Adam Foltzer
5.0 out of 5 stars
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. Read more
Published on September 24, 2003 by therosen
2.0 out of 5 stars
"Cutesy-poo" approach detracts from the content.
The analysis of algorithms is an important aspect of computer programming, and it's actually a pretty interesting study in its own right. Read more
Published on December 27, 1998
What Other Items Do Customers Buy After Viewing This Item?
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
