Programming Assignments and Labs for Algorithm Specialization (4 Courses) offered by Stanford University via the Coursera network
- Introduction (Grade school multiplication vs Karatsuba multiplication)
- Asymptotic analysis (Big Oh, Big Omega, and Big Theta)
- Divide and Conquer paradigm
- Merge sort algorithm
- The master theorem
- Randomized algorithm design
- Quick sort algorithm
- Graph concepts (edges, vertices. cuts, applications)
- Contraction algorithm (Karger's algorithm)