Introduction
  • Introduction to Algorithms
  • Intro Continued
  • Course Overview
  • Course Overview Part 2
Algorithmic Thinking
  • Merge Sort
  • Pseudocode
  • Merge Sort Analysis
  • Guiding Principles of Algorithm Assessment
  • Big Oh Definition
  • Big Oh Examples
  • Omega, theta, little oh
  • Additional Examples
  • Divide and Conquer Inversions
  • Counting Inversions
  • Multiplying Matrices
  • Closest Pair Part 1
  • Closest Pair Part 2
  • 18. Master Method
  • Master Method Precise
  • Master Method Examples
  • Master Method Proof Part 1
  • Master Method Proof Part 2
  • Master Method Proof Part 3
  • Quick Sort
  • Quick Sort Pivot Partition
  • Quick Sort Pivot Point
  • Partition Subroutine
  • Quick Sort Decomposition
  • Quick Sort Proof Continued
  • Probability
  • R select
Data Structures
  • Linear Time Selection
  • Data Structure Intro
  • Heaps
  • Heap Implementation
  • Balanced Binary Trees
  • Hash Tables