- STAFF PICKS
- GIFTS + GIFT CARDS
- SELL BOOKS
- FIND A STORE
New Trade Paper
Ships in 1 to 3 days
Other titles in the In a Nutshell series:
Algorithms in a Nutshell (In a Nutshell)by Gary Pollice
Synopses & Reviews
Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm for your needs — with just enough math to let you understand and analyze algorithm performance.
With Algorithms in a Nutshell, you'll learn how to improve the performance of key algorithms essential for the success of your software applications.
Book News Annotation:
This review of common algorithms in the IT field is designed for programmers who need to choose and implement the right process for a specific problem with only a modicum of applied mathematical theory. Heineman, Pollice and Selkow (computer science, Worcester Polytechnic Institute, UK) provide a variety of algorithms in such programming languages as C, C++, Java and Ruby, and explain the data structures behind this information so that the algorithms can be used more efficiently. A final section is included that provides additional resources and ideas when existing algorithms do not supply an effective solution for programming obstacles. Annotation ©2009 Book News, Inc., Portland, OR (booknews.com)
Creating software systems involves more than simply writing a program. It requires creativity and technical excellence. Technical excellence includes the ability to make programs robust and efficient. Efficient algorithms are at the heart of all but the most trivial programs. Programmers, however, seldom think about the algorithms in their programs until they encounter problems. Many programmers do not have a background in algorithm analysis and design and if they do, they don't take the time to find the right algorithm for their needs. Algorithms in a Nutshell helps programmers select, analyze, and implement the right algorithms for their particular needs. It provides just enough mathematics to let the reader understand and analyze algorithm performance. The algorithms in the book are based upon the type of problems they address. Each algorithm is presented in the style of a design pattern - an approach, or plan for how to solve the problem accompanied by the information needed to understand why the algorithm is appropriate, how one might determine why the algorithm is the right one, and implementation tips. This is a major benefit to the reader. Just as design patterns for object-oriented design enable developers to use a common language to describe their designs, we believe that providing a pattern language for algorithms can enable similar communication benefits.
About the Author
George Heineman is an Associate Professor of Computer Science at WPI. His research interests are in Software Engineering. He co-edited the 2001 book "Component-Based Software Engineering: Putting the Pieces Together". He was the Program Chair for the 2005 International Symposium on Component-Based Software Engineering.
Gary Pollice is a self-labeled curmudgeon (that's a crusty, ill-tempered, usually old man) who spent over 35 years in industry trying to figure out what he wanted to be when he grew up. Even though he hasn't grown up yet, he did make the move in 2003 to the hallowed halls of academia where he has been corrupting the minds of the next generation of software developers with radical ideas like, "develop software for your customer, learn how to work as part of a team, design and code quality and elegance and correctness counts, and it's okay to be a nerd as long as you are a great one."
Stanley Selkow received a BS in Electrical Engineering from Carnegie Institute of Technology in 1965, and then a Ph.D. in the same area from the University of Pennsylvania in 1970. From 1968 to 1970 he was in the Public Health Service at the National Institutes of Health at Bethesda Maryland. Since 1970 he has been on the faculty at universities in Knoxville TN and Worcester MA, as well as Montreal, Chonqing, Lausanne and Paris. His major research has been in graph theory and algorithm design.
Table of Contents
Preface Part I: I Chapter 1: Algorithms Matter Chapter 2: The Mathematics of Algorithms Chapter 3: Patterns and Domains Part II: II Chapter 4: Sorting Algorithms Chapter 5: Searching Chapter 6: Graph Algorithms Chapter 7: Path Finding in AI Chapter 8: Network Flow Algorithms Chapter 9: Computational Geometry Part III: III Chapter 10: When All Else Fails Chapter 11: Epilogue Part IV: IV Appendix A: Benchmarking About the Authors Colophon
What Our Readers Are Saying
Other books you might like