Design and Analysis of Algorithms I

4 credits

Principles of design of efficient algorithms: recursion, divide and conquer, balancing, dynamic programming, greedy method, network flow, linear programming. Correctness and analysis of algorithms. NP-completeness. Prerequisite: either CSE 332 or equivalent.