Algorithms

by Richard Johnsonbaugh

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.

Genres: Computer Science

768 pages, Hardcover

First published July 31, 2003

About the author

Richard F. Johnsonbaugh is an American mathematician and computer scientist. His interests include discrete mathematics and the history of mathematics. He is the author of several textbooks.
Johnsonbaugh earned a bachelor's degree in mathematics from Yale University, and then moved to the University of Oregon for graduate study. He completed his Ph.D. at Oregon in 1969. His dissertation, I. Classical Fundamental Groups and Covering Space Theory in the Setting of Cartan and Chevalley; II. Spaces and Algebras of Vector-Valued Differentiable Functions, was supervised by Bertram Yood. He also has a second master's degree in computer science from the University of Illinois at Chicago.
He is currently professor emeritus at De Paul University.