This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting, divide-and-conquer, dynamic programming, graph algorithms, shortest paths, network flow, polynomial and matrix calculations, parallel computing.