Find a university to explore its courses and reviews.
Algorithm design techniques and complexity analysis including divide and conquer, dynamic programming, greedy algorithms, 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.