Algorithm Analysis

3 credit hours · Undergraduate

Key techniques of efficient algorithm design are discussed including: divide and conquer; greedy methods; dynamic programming; graph traversal; and change of representation. Analyzing algorithm performance and lower bounds for various problems are studied.