Algorithms [Hardcover]

Richard Johnsonbaugh (Author), Marcus Schaefer (Author)

Book Description

ISBN-10: 0023606924 | ISBN-13: 978-0023606922 | Publication Date: August 10, 2003

Filling the void left by other algorithms books, Algorithms and Data Structures provides an approach that emphasizes design techniques. The volume includes application of algorithms, examples, end-of-section exercises, end-of-chapter exercises, hints and solutions to selected exercises, figures and notes to help the reader master the design and analysis of algorithms. This volume covers data structures, searching techniques, divided-and-conquer sorting and selection, greedy algorithms, dynamic programming, text searching, computational algebra, P and NP and parallel algorithms. For those interested in a better understanding of algorithms.

Editorial Reviews

From the Back Cover

Algorithms is written for an introductory upper-level undergraduate or graduate course in algorithms. With/their many years of experience in teaching algorithms courses, Richard Johnsonbaugh and Marcus Schaefer include applications of algorithms, examples, end-of-section exercises, end-of-chapter exercises, solutions to selected exercises, and notes to help the reader understand and master algorithms.

Key Features

• Links theory to real-world applications such as data compression, region-finding in digital pictures, cellular phone networks, and the implementation of agrep.
• Includes five chapters that emphasize design techniques: searching (including backtracking), divide and conquer, sorting, selection, the greedy method, and dynamic programming.
• Covers distributed algorithms—a topic recommended by the ACM (2001 report) for an undergraduate curriculum.
• Features a collection of techniques, including approximation, parameterization (a recent area of research), and use of heuristics, to deal with NP-complete problems.
• Contains more than 1450 carefully developed and classroom-tested exercises, from routine to challenging. About one-third of the end-of-section exercises include solutions.
• Provides a robust Companion Website that supplements the text by providing algorithm simulation software, PowerPoint^® slides, late breaking news about algorithms, references about the book's topics, computer programs, and more.
• Includes more than 300 worked examples, which provide motivation, clarify concepts, and show how to develop algorithms, demonstrate applications of the theory, and elucidate proofs.

About the Author

Richard Johnsonbaugh is Professor Emeritus of Computer Science at DePaul University. He has degrees in computer science and mathematics from the University of Oregon, Yale University, and the University of Illinois at Chicago. He is the author of numerous articles and books, including Discrete Mathematics, Fifth Edition, and, with co-author Martin Kalin, Object-Oriented Programming in C++, Second Edition, Applications Programming in C++, and Applications Programming in ANSI C, Third Edition.

Marcus Schaefer is Assistant Professor of Computer Science at DePaul University. He holds degrees in computer science and mathematics from the University of Chicago and the Universitat Karlsruhe. He has authored and co-authored several articles on complexity theory, computability, and graph theory.

See all Editorial Reviews

Product Details

• Hardcover: 768 pages
• Publisher: Prentice Hall (August 10, 2003)
• Language: English
• ISBN-10: 0023606924
• ISBN-13: 978-0023606922
• Product Dimensions: 10 x 8.3 x 1.3 inches
• Shipping Weight: 3.4 pounds (View shipping rates and policies)
• Average Customer Review: 4.0 out of 5 stars  See all reviews (2 customer reviews)
• Amazon Best Sellers Rank: #341,374 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

3 of 3 people found the following review helpful:

4.0 out of 5 stars Excellent Algorithms Book -- For Graduate Students Only, July 26, 2009

By 

Joe Banks (New York, NY) - See all my reviews

This review is from: Algorithms (Hardcover)

I am a professor who has used book for the last three years for my Algorithms class. I have reviewed many books on the design and analysis of algorithms. It is surprising to me that, on the subject of something as fundamental to computer science as algorithms, that there are so few really good texts--fortunately this is one of them. On the plus side, it has just the right amount of mathematical rigor and is very comprehensive. Of special note the the excellent chapters on Coping with NP completeness and Text Searching. It does have some issues, however. As a previous reviewer pointed out, it is very expensive. In addition, many of the chapter exercises are extremely difficult and there should be selected answers to these in back of the book. This is definitely a graduate text--would not recommend for undergrads. For Professors, I found the instructor materials for this book to be on the thin side, with many gaps in coverage. It could also use a chapter on evolutionary algorithms. Hopefully this will be corrected in a subsequent edition.

1 of 1 people found the following review helpful:

4.0 out of 5 stars Good Introduction to Algorithms, April 18, 2009

By 

Samir Bajaj (Seattle, WA USA) - See all my reviews
(REAL NAME)   

This review is from: Algorithms (Hardcover)

This is actually a pretty decent book, and does a reasonably good job of introducing algorithm analysis and design. I suspect it is not terribly popular because it is very expensive, and does not offer any distinct material that one would otherwise not find in the dozens of other books available on this subject. Nonetheless, I found it enjoyable.