Session Details

Week 9, Session 25 — Tue Oct 30

Preparation

  1. §8.6-8.8

Due

Topics

  1. Quicksort improvements
  2. Lower bound for sorting algorithms.
  3. Radix sort
  4. Scrabble work time

Outline

  1. [5 min] Break
  2. [10 min] Quicksort improvements
  3. [20 min] Average BST height
  4. [40 min] Lower-bound of comparison-based sorting algorithms

Resources

  1. Slides
  2. Weiss code for various sorts

HW Assigned

  1. See Preparation, Due, and Major Programs columns on the main schedule page