CS 245 - Data Structures and Algorithms (4)

Algorithm analysis and asymptotic running time calculations. Algorithm design techniques and implementation details. Algorithms for sorting and searching, trees, graphs, and other selected topics. Four hours lecture. Offered every Spring. Prerequisites: CS 112 (grade of C or better) and MATH 201 (grade of C or better).