About
This course covers algorithm analysis, focusing on correctness, performance, and design strategies. Students learn to evaluate algorithms through inductive proofs, loop invariants, and asymptotic analysis, including worst-case and probabilistic scenarios. Topics include randomized algorithms, divide and conquer, dynamic programming, greedy strategies, sorting algorithms, and the analysis of dynamic data structures.
Resources