CSE 331: Introduction to Algorithm Analysis and Design
This page refers to the Spring 2009 offering of CSE 331 only. The information on this page does not necessarily apply to every offering of CSE 331.
Spring 2009
20737
Introduction to Algorithm Analysis and Design
Introduces methods for algorithm design, paradigms such as divide and conquer, greedy, and dynamic programming, and techniques for algorithm analysis, such as asymptotic notations, estimates and recursions. Topics include sorting, searching, scheduling, string matching, graph algorithms, computational geometry, and more.
None presently available.
CSE 191, CSE 250, MTH 142
