I plan to cover

• Chapter 1
  • Intro
  • What is an Algorithm?
  • Some Code
• Chapter 2
  • Empirical Analysis of Algorithms
  • The Analysis Framework
  • Asymptotic Notations and Base Efficency Classes
  • Mathematical Analysis of Nonrecursive Algorithms
  • Mathematical Analysis of Recursive Algorithms
• Chapter 3
  • Brute Force part 2
  • Graphs
  • Exhaustive Search
  • BFS and DFS
• Chapter 4
  • Decrease and Conquer and Insertion Sort
  • Topological Sort
  • Permutations
  • Decrease by a Constant Factor
  • Decrease by a Variable Factor
• Chapter 5
  • Intro to Divide and Conquer
  • Quicksort
  • Trees
  • QuickHull
• Chapter 6 (and other things)
  • Heapsort
  • Non-Comparison Based Sorts
  • Horner's Rule
  • Amortized Analysis Part 1
• Chapter 7
  • Thanks Dr. Dasgupta.
• Chapter 11
  • Introduction
  • CIRCUIT-SAT
  • Furhter NP-Complete problems
  • Approximation Algorithms
• Chapter 12
  • Numerical Algorithms
• Last Day