1. Algorithms

2. http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-006Spring-2008/LectureNotes/index.htm

3. Hash Tables n steps Linear Time Constant Time n 2 time n time http://ocw.mit.edu/ans7870/6/6.006/s08/lecturenotes/files/docdist1.py http://ocw.mit.edu/ans7870/6/6.006/s08/lecturenotes/dd_prog4.htm

4. Profiling

5. O(n) << O(n 2 ) Time n = |words|

6. Excel nslowfast 1,0000.0320.006 10,0000.0650.062 100,00022.5800.664 260,81994.7134.775

7. Group Problems by Time Bounds log(n) – Binary Search, Fibonacci n – tr, cat, cut, uniq, egrep n log n – Sort n 2 – Edit Distance (http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Dynamic/Edit/)http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Dynamic/Edit/ n 3 – Matrix Multiplication n 2.376 – Context-Free Parsing 2 n – Factoring – Satisfiability

8. http://ocw.mit.edu/NR/rdonlyres/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/LectureNotes/lec3.pdf http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/VideoLectures/detail/embed03.htm