feb 29
transform-and-conquer overview
6.1
Many problems can be done by sorting a list first:
uniqueness, median, searching (if search will be repeated).
6.2
matrix problems: gaussian elimiation, matrix inversion: I think we'll skip this
6.3
balanced search trees
This is a classic example, done in nearly all algorithms class; read this part carefully and look up elsewhere if need be
6.4
heaps and heapsort
This is also important; read it closely.
Definition: a "heap" is a binary complete (except for bottom which may have some right nodes missing) tree with parent key's > children's.
- constructing heaps
- heapsort
6.5
polynomials and exponentiation
We'll do a bit of this: definitely the exponentiation, maybe the polynomials.
6.6
reduction
- simplex and linear programming
- graphs and state-space
