A study of the design and analysis of computer algorithms. Topics include: asymptotic analysis, efficient algorithm design, sorting and order statistics, hashing, binary search trees, graph algorithms, matrix multiplication, and NP completeness. This course begins a more in-depth study in the theory and science of computation. Prerequisites: COMP 152, MATH 260. Offered in alternate years. (One course).
- Teacher: James Mayfield