This is an introductory-level algorithm book. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application.
Includes structured material by techniques employed, not by the application area, so readers can progress from the underlying abstract concepts to the concrete application essentials. It begins with a compact, but complete introduction to some necessary math. And it approaches the analysis and design of algorithms by type rather than by application.
A textbook for an undergraduate course in algorithmics. It concentrates on fundamental techniques including greedy algorithms, divide-and-conquer, dynamic programming, graph techniques, probabilistic algorithms, and parallel algorithms. Each technique is first presented generally, and then illustrated by concrete examples of algorithms taken from such different applications as optimization, linear algebra, cryptography, computational number theory, graph theory, operations research, and artificial intelligence. Special attention is paid to integrating the design of algorithms with the analysis of their efficiency. Some 500 problems are included. Annotation c. Book News, Inc., Portland, OR (booknews.com)