CS 4300 - Algorithm Design and Analysis (3)

Techniques needed to analyze algorithms. The application of these techniques to topics such as sorting, graph algorithms, fast Fourier transforms, dynamic programming, and NP-completeness. Prerequisite(s): CS 2300 and CS 2400. Not available for graduate credit.