Analysis of Algorithms.

Catalog description

PR: WVU sections require CS 111 and CS 111L with a minimum grade of C- in each and MATH 156 and ( CS 220 or MATH 303 ), WVUIT sections require CS 201 and CS 220 and MATH 156 with a minimum grade of C- in each. Introduction to algorithm design and analysis. Growth rate of functions and asymptotic notation. Divide-and-conquer algorithms and recurrences; searching and sorting; graph algorithms including graph searching, minimum spanning trees, and shortest paths.