2
Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice.
FREE
This course includes
Units & Quizzes
23
Unlimited Lifetime access
Access on mobile app
Certificate of Completion
Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorithms; and shortest paths. Advanced topics may include network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, and parallel computing
Course Currilcum
- Introduction, median finding Unlimited
- Median finding, interval scheduling Unlimited
- Minimum spanning trees I Unlimited
- Minimum spanning trees II Unlimited
- Fast Fourier transform Unlimited
- All-pairs shortest paths I Unlimited
- All-pairs shortest paths II Unlimited
- Randomized algorithms I Unlimited
- Randomized algorithms II Unlimited
- Hashing and amortization Unlimited
- Amortized analysis Unlimited
- Competitive analysis Unlimited
- Network flow Unlimited
- Interlude: problem solving Unlimited
- van Emde Boas data structure Unlimited
- Disjoint-set data structures Unlimited
- Complexity and NP-completeness Unlimited
- Polynomial-time approximations Unlimited
- Compression and Huffman coding Unlimited
- Sublinear-time algorithms Unlimited
- Clustering Unlimited
- Derandomization Unlimited
- Computational geometry Unlimited
Massachusetts Institute of Technology
5
⭐ Instructor rating
Followers
0
Following
0
Groups
0
Friends
0
