# Chapter 1 Front Page 2 Introduction Programming Strategies 3 Programming Strategies 4 Objects and ADTs 5 Constructors and destructors 6 Data Structure 7 Methods 8 Pre- and post-conditions 9 C conventions 10 Error Handling 11 Some Programming Language Notes Data Structures 12 Arrays 13 Lists 14 Stacks 15 Recursion Searching 16 Sequential Searches 17 Binary Search 18 Trees Complexity 19 Complexity 20 Complexity (PS) Queues 21 Priority Queues 22 Heaps Sorting 23 Bubble 24 Heap 25 Quick 26 Bin 27 Radix Searching Revisited 28 Searching Revisited 29 Red-Black trees 30 AVL trees 31 General n-ary trees 32 Hash Tables Dynamic Algorithms 32 Fibonacci Numbers 33 Binomial Coefficients 34 Optimal Binary Search Trees 35 Matrix Chain Multiplication 36 Longest Common Subsequence 37 Optimal Triangulation Graphs 38 Minimum Spanning Tree 39 Dijkstra's Algorithm Others 40 Huffman Encoding 41 FFT Hard or Intractable Problems 42 Eulerian or Hamiltonian Paths 43 Travelling Salesman's Problem 44 Games 45 ANSI C 46 Source code listings