Analysis of Quicksort (6)

Michael L. Littman

September 18th, 1997

• PROBLEM WITH QUICKSORT
  • Review
  • Quicksort Algorithm
  • Partition
  • Analysis
  • Expected Case?
  • Rock, Paper, Scissors
  • Importance of Being Random
  • Preview
• PROBABILITY THEORY
  • Probability
  • Language of Probability
  • Axioms of Probability
  • Probability Properties
  • Counting
  • Combinatorial Sample Spaces
  • Coin-flip Experiment
  • Expectation
  • Expected Running Time
  • Example
• RANDOMIZED QUICKSORT
  • Basic Idea
  • Pseudocode
  • Expected-Case Recurrence
  • Good and Bad Splits
  • Analysis of Good Splits
  • Asymptotic Bound
  • Analysis of Bad Splits
  • Expected Run Time
  • Asymptotic Bound
  • Wrap Up
• HOMEWORK
  • Homework 2
  • Sparse Matrices
  • Homework 3