Cook's Theorem -- CNF-SAT in NP-Complete
The Turing Machine Introduction to NP-Complete
Network Flow (part 1) Network Flow (part 2)
RNA Folding Algorithm Edit Distance
Dynamic Programming Longest Common Subsequence
Prim's and Dijkstra's Algorithm
Examples of Divide and Conquer