Lecture notes

• Thu Jan 25 - Euclid's algorithm
• Mon Jan 29 - data structures in C
• Thu Feb 1 - homework; algorithm efficiency
• Mon Feb 5 - math sums and efficiency
• Thu Feb 8 - finish O(n) homework; start brute force chapter
• Mon Feb 12 - brute force
• Thu Feb 15 - divide and conquer
• Thu Feb 22 - homework; start decrease-and-conquer
• Mon Feb 26 - more decrease-and-conquer : depth-first, breadth-first, odd ball puzzle
• Thu Feb 29 - homework; start transform-and-conquer
• Mon March 5 - AVL trees, heaps, and all that
• Thu March 8 - homework; mid-term discussion; overview of hashes and B-trees
• Mon March 12 - space and time (chap 7)
• Thu March 15 - homework; projects; crypto (if time)
• ... spring break ...
• Mon April 2 - heap projects; start greedy algorithms
• Thu April 5
• Mon April 9 - Jim's heap and start of huffman
• Thu April 12 - homework; overview of iterative improvement
• Mon April 16 - iterative improvement
• Mon April 23 - limitation (P, NP, numerical round-off)
• Thu April 26 - homework; start last chapter: approximate methods
• Mon April 30 - approximation to NP problems
• Thu May 3 - homework; other topics
• Mon May 7 - evolutionary algorithm (genetic TSP)