• Chapter 1
  • Introduction
  • Math
  • Recursion Review
  • C++ and ADT
  • Performance of a vector class
  • sort
• Chapter 2, Algorithm Analysis
  • Big O notation
  • Maximum Subsequence
• Chapter 3, Lists, Stacks and Queues
  • Lists
  • Stacks
  • Queues
• Chapter 4, Trees
  • Definitions
  • Basic Algorithms
  • Binary Trees
  • Binary Search Trees
  • AVL Trees
• Chapter 7, (sort of) Sorts
  • Selection Sort
  • Insertion Sort
  • Bubble Sort
  • A bound on sorts that swap adjacent elements
  • Shell Sort.
  • Merge Sort
  • Quick Sort
  • Bucket Sort
• Computability
  • Overview
  • Reduction
  • Circuit Satisfiability
  • Some other problems that are NP-Complete