CECS 328 Lectures

1. Big-O notation and the growth of functions
2. Complexity of algorithms
3. C for Java Programmers
4. Hashing
5. Sorting
6. Binary Heaps
7. Trees
8. AVL Trees
9. Splay Trees
10. Graph Algorithms
11. Introduction to Dynamic Programming