An introduction to important concepts in the design and analysis of algorithms and data structures, including implementation, complexity, analysis, and proofs of correctness. Prereq: understanding of basic data structures, familiarity with proof methods and basic concepts from discrete mathematics and the ability to program with recursion.