Algorithm Design & Analysis

Catalog description

Algorithm analysis and asymptotic notation. Advanced data structures analysis. Design and analysis of: divide-and-conquer algorithms, dynamic programming, greedy algorithms, and amortized analysis; multi-threaded algorithms, linear programming, number-theoretic algorithms, computational geometry, approximation algorithms, and foundational algorithmic techniques relevant to AI/ML applications.