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