Contents

pp vii-x

Preface

pp xi-xiv

Introduction

pp 1-2

Part One - Iterative Algorithms and Loop Invariants

pp 3-4

1 - Iterative Algorithms: Measures of Progress and Loop Invariants

pp 5-28

2 - Examples Using More-of-the-Input Loop Invariants

pp 29-42

3 - Abstract Data Types

pp 43-59

4 - Narrowing the Search Space: Binary Search

pp 60-70

5 - Iterative Sorting Algorithms

pp 71-78

6 - Euclid's GCD algorithm

pp 79-84

7 - The Loop Invariant for Lower Bounds

pp 85-94

Part Two - Recursion

pp 95-96

8 - Abstractions, Techniques, and Theory

pp 97-113

9 - Some Simple Examples of Recursive Algorithms

pp 114-129

10 - Recursion on Trees

pp 130-152

11 - Recursive Images.

pp 153-158

12 - Parsing with Context-Free Grammars

pp 159-168

Part Three - Optimization Problems

pp 169-170

13 - Definition of Optimization Problems

pp 171-172

14 - Graph Search Algorithms

pp 173-197

15 - Network Flows and Linear Programming

pp 198-224

16 - Greedy Algorithms

pp 225-250

17 - Recursive Backtracking

pp 251-266

18 - Dynamic Programming Algorithms

pp 267-294

19 - Examples of Dynamic Programs

pp 295-323

20 - Reductions and NP-Completeness

pp 324-345

21 - Randomized Algorithms

pp 346-354

Part Four - Appendix

pp 355-356

22 - Existential and Universal Quantifiers

pp 357-365