Introduction to the design, behavior, and analysis of computer algorithms. Searching, sorting, and combinatorial algorithms are emphasized. Worst case, amortized, and expected bounds on time and space usage.
[(CS 330 with min. grade of D and CS 331 with min. grade of D) OR (CS 331 with min. grade of D and MATH 230 with min. grade of D) OR (CS 401) OR (CS 403)]