Presentation Slides

  1.  Code Tuning
  2.  Math and Logic
  3.  Complexity
  4.   Amortized Complexity and Master Method
  5.   More Sorting Techniques
  6.  Graphs
  7.  Hashing
  8.  Work on the problem not the code
  9.  Divide and Conquer
  10.  Greedy programming
  11.  Minimum Spanning Trees
  12.  Dynamic programming
  13.  Backtracking
  14.  Branch and Bound
  15.  String matching
  16.  Shortest Path Algorithms
  17.  Max Flow
  18.  Parallel Algorithms
  19.  Cache Oblivious Algorithms
  20.  Classification of Problems
  21.  Approximation Algorithms