Introduction to the Design and Analysis of Algorithms

Design and analysis of efficient algorithms including sorting, searching, dynamic programming, graph algorithms, fast multiplication, and others; nondeterministic algorithms and computationally hard problems. Prerequisites: Computer Science 201 and 230.