Essential Algorithms

Catalog description

This course covers the basic techniques used to analyze problems and algorithms, including asymptotic, upper/lower bounds, and best/average/worst case analysis. Amortized analysis, complexity, and basic techniques are used to design algorithms and to analyze important classical algorithms including sorting, string, matrix, and graph algorithms. The goal for the student is to be able to apply all the above to design solutions for real-world problems.