Topics for ECS 122A
The following lists the "potential" topics I will choose among.
- Introduction *
- Recurrences *
- Quicksort *
- Heapsort *
- Selection *
- Linear-time sorting *
- Hashing *
- Program checking *
- Binary search trees *
- Splay trees *
- Dynamic programming *
- Huffman codes *
- Depth-first search *
- Minimum spanning trees *
- Fibonacci heaps #
- Union-Find #
- String matching *
- Shortest paths *
- Stable marriages *
- Disjoint sets *
- Convex Hull
- NP-Completeness *
- Approximation schemes
- Branch-and-bound
/* End of quarter note: I append a "*" to mark the topics which I
actually covered, and a "#" to mark
topics for which we stated results, but where I gave no details. */