Find a university to explore its courses and reviews.
Techniques for algorithm design and analysis including greedy algorithms, divide and conquer, dynamic programming, network flow, and NP-completeness.
No one has reviewed this course yet. Share your experience and help future students know what to expect.
Anonymous · no account needed · 10 seconds