1st Edition
Algorithm Design: A Methodological Approach - 150 problems and detailed solutions
820 Pages
260 B/W Illustrations
by
Chapman & Hall
820 Pages
260 B/W Illustrations
by
Chapman & Hall
820 Pages
260 B/W Illustrations
by
Chapman & Hall
Also available as eBook on:
A bestseller in its French edition, this book is original in its construction and its success in the French market demonstrates its appeal. It is based on three principles: (1) An organization of the chapters by families of algorithms: exhaustive search, divide and conquer, etc. On the contrary, there is no chapter devoted only to a systematic exposure of, say, algorithms on strings. Some of these... Read more
Table of Contents
Preface
- Mathematics and Computer Science: Some Useful Notions
- Complexity of an Algorithm
- Specifications, Invariants, Iteration
- Reduce and Conquer, Recursion
- Generate and Test
- Branch and Bound
- Greedy Algorithms
- Divide and Conquer
- Dynamic Programming
Notations
List of Problems
Bibliography
Index
Biography
Patrick Bosc, Marc Guyomard, and Laurent Miclet are former professors at Enssat, Engineering school of University of Rennes, France and senior researchers at IRISA. They have taught Data Structures, Algorithmic, Databases, Formal methods, Language theory, Compiling, etc. for numerous years at the Bachelor and Master levels.
