Useful links, animations, etc

• Mathematics for computer science by E. Lehman, T. Leighton and A. Meyer
• Building blocks for theoretical computer science by Margaret Fleck
• MIT open courseware
• Algortithms textbook by Dasgupta, Papadimitriou and Vazirani online
• Sorting animations: all sorts | Progr.pearls
• Zeno's paradoxes
• Mathematical induction:
  • Mathematical induction (Robert Plummer, Stanford)
  • Mathematical induction (V. Adamchik, CMU)
  • Mathematical induction(Tom Davis, Utah)
  • Mathematical induction (TheMathPage)
  • Induction(YouTube)

• Mergesort (Princeton)
• Demo-partition (Princeton
• Divide-and-conquer (Princeton) | Matrix multiplication (Princeton)
• Graph vizualizations (Princeton)| CC | BFS | DFS
• Dijkstra/MST animation | another Dijkstra animation | Slides (Princeton) | UnionFind (Princeton)
• Fun read: Pessimal algorithms (Broder, Stolfi)
• Complexity
  • Longest path
  • Complexity (lecture by E. Demaine)
  • P vs NP problem(Lecture by M. Sipser, Clay Institute, hosted at Harvard 2006)
  • P=NP(Erik Demaine proves P=NP)

Other undergraduate algorithm classes on the web:

• Swarthmore: cs41-fall12 (Danner, KT) | spring15 (Brody, KT)
• Williams: cs256-spring2013 (Heeringa, KT) <---- check out the grading scheme!
• Carleton: cs252-W14 (Miles, KT) |
• Wellesley: Spring 2016 (Metaxas, CLRS)
• MIT Open CourseWare: Algorithms (CLRS) | Fall 2002 (Demaine, Goldwasser)
• Stanford: Winter 2016 (Guibas, CLRS)
• CMU: Algorithms (Avrim Blum, Fall 2015)
• Berkeley: Algorithms (David Wagner, Fall 2014)
• UIUC: Algorithms, Etc (Jeff Erikson)