Algorithm Sources

• Here is a set of three short video lectures from Coursera covering the analysis of quicksort.
• Linear-time Sorting: Here is a video lecture from ocw mit on Counting sort and Radix sort. 
• This, this, this, and this: sources for Morris traversal, an inorder traversal of a binary search tree without using recursion or stack.
• Red-black tree: Here is an applet to play with red-black trees. Here is a video lecture on red-black trees from mit opencourseware.
• Here is a video lecture on Dynamic Order Statistics from ocw mit.
• Dynamic Programming: Longest common subsequence, Rod-cutting
• List of algorithms: Depth-first search, Breadth-first search, Topological sort, Kosaraju-Sharir, Kruskal, Prim, Dijkistra, Bellman-Ford, Ford-Fulkerson, LSD radix sort, MSD radix sort, 3-way radix quicksort, Multiway tries, Ternary search tries, Knuth-Morris-Pratt, Boyer-Moore, Rabin-Karp, Regular expression matching, Run-length coding, Huffman coding, LZW compression, and the Burrows-Wheeler transform