Resources

Schedule:

Class schedule (subject to change)

Book:

E-book link for the textbook, through Tulane's library.

Demos:

Miscellaneous:

Union-Find O(n log* n) runtime: CMU lecture notes, wikipedia
High probability bounds:
- For Quicksort (pages 38-43)
- For Randomized Select (pages 32-39)
Combinatorics of the change-making problem by Adamaszek and Adamaszek.
The Stony Brook Algorithms Repository
MIT Algorithms Course 1 (by Leiserson and Demaine), 2 (by Demaine, Devadas, Lynch). These contain video lectures, assignments, practice problems, etc.
Khan Academy Algorithms tutorial, with content by Cormen and Balkcom
Complexity classes:
TSP: "Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey" by Bukard et al.

Last modified by Carola Wenk, cwenk -at- tulane -dot- edu,