Adv Data Structures and Algs

Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: mathematical foundations; all five asymptotic notations; analytic, empirical, and qualitative evaluation techniques; sorting algorithms; balanced trees (2-3-4 trees and red-black trees); dynamic programming; and NP-completeness.