Resources

• Class schedule
• Study resources:
  • Midterm review
• Demos:
  • Visualizations of multiple data structures by David Galles
  • Red-black tree demo
  • Another red-black tree demo
  • 2-3-4 tree demo
  • B-tree demo; make sure to check "preemtive split/merge" (it uses 2k as the max degree, so it only works for 2k=4 and 2k=6)
  • B-tree notes with more details and variants (also deletion)
  • BST demos
  • Java applets visualizing Prim, Kruskal, Dijkstra, Ford-Fulkerson
  • Algorithm animations (for sorting, trees, and graph algorithms)
• Videos:
  • Plenary talk about "Algorithms -- Advances and Challenges" by Knuth Prize Winnter Ravi Kannan from Microsoft Research
  • ``Algorithm'' is not a 4-letter word: Presentation about importance and fun of algorithms, in particular maze-generation algorithm (based on graph algorithms and MST algorithms)
• Miscellaneous:
  • The Stony Brook Algorithms Repository
  • NIST Dictionary of Algorithms and Data Structures
  • B-Tree description (similar to the slides)
  • MIT Algorithms Course. This contains video lectures, assignments, practice problems, etc.
  • 2014 ACM programming contest world finals problem set
• Complexity classes:
  • Complexity zoo
  • Complexity class diagram
  • Other complexity classes

If you find any additional interesting links that you think would be valuable for other students, please email the instructor.