Find a university to explore its courses and reviews.
Design and analysis of algorithms including divide-and-conquer, greedy methods, dynamic programming, graph algorithms, and NP-completeness.
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.