
Fundamentals of Algorithmics, 1/e
Gilles Brassard, the University of Montreal
Paul Bratley, the University of Montreal
Published August, 1995 by Prentice Hall Engineering/Science/Mathematics
Copyright 1996, 524 pp.
Cloth
ISBN 0133350681

Sign up for future mailings on this subject.
See other books about:
AlgorithmsComputer Science

This is an introductorylevel algorithm text. It includes workedout
examples and detailed proofs. Presents Algorithms by type rather
than application.
structures material by techniques employed, not by the application
area, so students can progress from the underlying abstract concepts
to the concrete application essentials.
begins with a compact, but complete introduction to some
necessary math, and also includes a long introduction to proofs
by contradiction and mathematical induction. This serves to fill
the gaps that many undergraduates have in their mathematical knowledge.
gives a paced, thorough introduction to the analysis of
algorithms, and uses coherent notation and unusually detailed
treatment of solving recurrences.
includes a chapter on probabilistic algorithms, and
an introduction to parallel algorithms, both of which are becoming
increasingly important.
approaches the analysis and design of algorithms by type
rather than by application.
1. Preliminaries.
2. Elementary Algorithmicss.
3. Asymptotic Notation.
4. Analysis of Algorithms.
5. Some Data Structures.
6. Greedy Algorithms.
7. DivideAndConquer.
8. Dynamic Programming.
9. Exploring Graphs.
10. Probabilistic Algorithms.
11. Parallel Algorithms.
12. Computational Complexity.
13. Heuristic and Approximate Algorithms.
References.
Index.
