Fundamentals of algorithmics
Gilles Brassard, Paul Bratley · Prentice-Hall, Inc eBooks · 1996
1. Preliminaries. 2. Elementary Algorithmicss. 3. Asymptotic Notation. 4. Analysis of Algorithms. 5. Some Data Structures. 6. Greedy Algorithms. 7. Divide-And-Conquer. 8. Dynamic Programming. 9. Exploring Graphs. 10. Probabilistic Algorithms. 11. Parallel Algorithms. 12. Computational Complexity. 13. Heuristic and Approximate Algorithms. References. Index.