Session Details

Week 6, Session 24 — Tue Jul 17

Preparation

  1. Section 8.4. Knapsack problem
  2. Also carefully re-read the two paragraphs at the bottom of page 260 and all of p261. At the beginning of this day's class, you will be asked to construct a good-suffix table for a pattern.

HW Due

Topics

  1. Finish AVL trees
  2. 2-3 trees
  3. Heap definition and representation
  4. insert and removeMax operations
  5. HeapSort
  6. BuildHeap

Outline

Resources

  1. Slides
  2. HeapSort code

HW Assigned

  1. HW 11