Part 1 Algorithm Design 2
1 Introduction 4
2 Problem Solving with a Computer 16
3 Top-Down Design 46
4 Iterative Algorithm Design Issues 64
5 Computation Models and Design by Refinement 88
6 Proof Rules—Basics 120
7 Design by Proof Rules 152
8 Design using Recursion 180
9 Abstract Algorithms-1-Divide-and Conquer 200
10 Abstract Algorithms 2—Greedy Methods 236
11 Abstract Algorithms 3—Dynamic Programming 268
12 Abstract Algorithms 4—Backtracking 310
13 Natural Algorithms—GA, SA, ANN, TS 340
Part 2 Algorithm Analysis 368
14 Efficiency of Algorithms 370
15 Examples of Complexity Calculation 404
16 Time-Space Trade-Off 434
17 Tractable and Non-Tractable Problems 462
18 Some NP and NP-Complete Problems ...