1. Data Structures and Algorithms I
CMP 338
Data Structures and Algorithms I
Day 15, 10/25/11
More Red Black Search Trees

2. Homework 10, due noon 10/21 Improve quicksort (any variant)
Use insertion sort to sort small regions
static void setSmall(int s)
static int getSmall()
Find the best value for small
Turn in (include your name in a comment)
a) working code for your program Homework10.java
b) performance numbers (standard out) hw10.txt
c) performance graphs hw10.doc or hw10.odt
d) your interpretation of the data hw10.doc or hw10.odt

3. Homework 11 due: noon 11/4
Implement 2-3 trees directly (Algorithms pg 452)
public class Homework11
extends AbstractOrderedSymbolTable (or)
implements OrderedSymbolTable
Implement different classes for 2-Nodes and 3-Nodes
Preserve 2-3 tree invariants:
Keys are ordered in the 2-3 tree
All paths from leaves to root are the same length
Correctness test: FrequencyCounter on tale.txt