Brief Contents
2 Problem Solving with a Computer
4 Iterative Algorithm Design Issues
5 Computation Models and Design by Refinement
9 Abstract Algorithms-1-Divide-and Conquer
10 Abstract Algorithms 2—Greedy Methods
11 Abstract Algorithms 3—Dynamic Programming
12 Abstract Algorithms 4—Backtracking
13 Natural Algorithms—GA, SA, ANN, TS
15 Examples of Complexity Calculation
17 Tractable and Non-Tractable Problems
18 Some NP and NP-Complete Problems
19 Randomized and Approximate Algorithms
Get Design and Analysis of Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.