Read our cookies policy and privacy statement for more information.
×Davis, California•
Complexity of algorithms, bounds on complexity, analysis methods. Searching, sorting, pattern matching, graph algorithms. Algorithm design techniques: divide-conquer, greedy, dynamic programming. Approximation methods. NP-complete problems.
Units: 4.0
Hours: Lecture—3 hour(s); Discussion—1 hour(s).