Useful links, animations, etc

• 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)

• Williams: cs256-spring2013 (Heeringa, KT) <---- check out the grading scheme!

• Carleton: cs252-W14 (Miles, KT) | cs252-w13 (Liben-Nowell, KT) <---- check out the "who to ask for help" section!

• Wellesley: CS231-fall 2014 (Metaxas, CLRS)

• MIT Open CourseWare: Algorithms (CLRS) | Fall 2002 (Demaine, Goldwasser)

• Stanford: Fall 2014 (Plotkin, CLRS) <---check out the "Why study algorithms" in the intro slides.