Author: (USA) Baase et al.
Publisher:
Publishing Time: 2002-04-01
Features: This book primarily consists of three parts: first, it introduces how to use algorithms to solve real-world problems frequently encountered in computer applications; second, it covers the fundamental principles and techniques of computational complexity; and finally, it explains NP-completeness problems and parallel algorithms. The book emphasizes algorithm design techniques. For each problem, it discusses multiple solution methods first, then designs, analyzes, modifies, or discards an algorithm through continuous in-depth research until a satisfactory result is achieved. Therefore, the authors hope that readers will gradually develop a new way of thinking when analyzing problems by reading this book. Based on the second edition, this edition adds three new chapters and many new topics, while also rearranging the original chapters. This edition also includes over 100 new exercises and Java examples. All programs in the book are provided in Java pseudocode.
Content:
1. Principles of Algorithm Analysis
2. Data Abstraction and Basic Data Structures
3. Recursion and Induction
4. Classification
5. Selection
6. Dynamic Collections and Searching
7. Graphs and Graph Traversal
8. Graph Optimization Problems and Greedy Algorithms
9. Transitive Closure
10. Dynamic Programming
11. String Matching
12. Polynomials and Matrices
13. NP-Completeness Problems
14. Parallel Algorithms
Appendix: Java Examples and Techniques
About the Authors:
Sara Baase is a professor of computer science at San Diego University and has been teaching CS for 25 years. Dr. Baase is a three-time recipient of the San State University Alumni Association's Outstanding Faculty Award and has written numerous textbooks in the areas of algorithms, assembly language, and social and ethical issues related to computing. She earned her doctorate at the University of California, Berkeley.
Allen Van Celder is a professor of computer science at the University of California at Santa Cruz, where he has been teaching CS for 12 years. He received his Ph.D. in Computer Science at Stanford University and is a past recipient of the Presidential Young Investigator Award.
Computer Algorithms: An Introduction to Design and Analysis, Third Edition
📌 Related Posts
Literature
Latest Britannica Encyclopedia of Major Inventions
2026-09-21
Literature
Biochemistry
2026-09-21
Literature
News Commentary Writing Tutorial
2026-09-22
Literature
Flash5 Online Animation Creation Guide from Flasher's Home - Including Disc
2026-09-13
Literature
Craftsmanship Production Practice
2026-09-23
Literature
Securities and Investments
2026-09-23
Literature
Network economy
2026-09-23
Literature
Travel Marketing
2026-09-23