Orient BlackSwan

About the BookAbout the AuthorTable of Contents

This is the thoroughly revised and updated edition of the text that helped establish computer algorithms as a discipline of computer science. Using the popular object-oriented language C++, the text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms. The second edition of Computer Algorithms/C++ emphasizes:

Design techniques: Divide and conquer, the greedy method, dynamic programming, backtracking and branch and bound are illustrated with several examples. Each algorithm is completely analyzed.
Examples: A wide range of examples provides students with the actual implementation of correct design.
The latest research: A thorough treatment of probabilistic and parallel algorithms is included.
Full integration of randomized algorithms: Performance with nonrandomized algorithms is thoroughly compared. Computer Algorithms/C++ is appropriate as a core text for upper- and graduate-level courses in algorithms.

Ellis Horowitz is Professor of Computer Science and Electrical Engineering at the University of Southern California. Dr Horowitz is the author of ten books and numerous journal articles and refereed conference proceedings. Sartaj Sahni is a Distinguished Professor and Chair of Computer and Information Sciences and Engineering at the University of Florida. Dr Sahni has published over 300 research papers and written 15 textbooks. Sanguthevar Rajasekaran is the UTC Chair Professor of Computer Science and Engineering at the University of Connecticut. He has published over 150 articles in journals and conferences, coauthored two textbooks and co-edited four books.

Preface / Introduction / Elementary Data Structures / Divide-and-Conquer / The Greedy Method / Dynamic Programming / Basic Traversal and Search Techniques / Backtracking / Branch and Bound / Algebraic Problems / Lower Bound Theory / NP-Hard and NP-Complete Problems / Approximation Algorithms / Pram Algorithms / Mesh Algorithms / Hypercube Algorithms / Index