Find a university to explore its courses and reviews.
Advanced study of algorithms and their analysis. Topics include divide-and-conquer, dynamic programming, greedy algorithms, graph algorithms, NP-completeness, and approximation algorithms.
No one has reviewed this course yet. Share your experience and help future students know what to expect.
Takes about 2 minutes. Every review is anonymous — no account needed.