CS 330

Algorithm Analysis (3 Cr.)

Prerequisites: CS 270 or CS 225, CS 280, MAT 200

Description: This course provides students with an introduction to the analysis of algorithms, specifically proving their correctness and making a statement about their efficiency. Topics for discussion may include loop invariants, strong mathematical induction and recursion, asymptotic notation, recurrence relations, and generating functions. Students will examine examples of algorithm analysis from searching and sorting algorithms.