When Offered:Fall Algorithmic paradigms, worst-case and average-case analysis, recurrence relations, lower bounds, classes of P and NP, and NP-complete problems. Applications including sorting, searching, dynamic structures, set algorithms, graph algorithms, randomized algorithms, and pattern matching. Prerequisite: C S 3460 (Data Structures).
