Introduction to Analysis of Algorithms

Catalog description

0) or better in both. Introduction to analysis of computer algorithms: criteria for algorithm analysis; algorithm complexity and asymptotic functions; algorithm design techniques such as recursive, divide-and-conquer, dynamic programming, greedy, backtracking, and branch-and-bound; introduction to Class P, NP, and NP-complete problems. Click here for the Summer 2026 Schedule of Classes Click here for the Fall 2026 Schedule of Classes Add to Portfolio (opens a new window) Add to My Favorites (opens a new window) Share this Page Facebook this Page (opens a new window) Tweet this Page (opens a new window)