Class 3. P: ECE 359 or equivalent or consent of instructor. Computation models and techniques for the analysis of algorithm complexity. The design and complexity analysis of recursive and nonrecursive algorithms for searching, sorting, and set operations; graph algorithms; matrix multiplication; polynomial evaluation; FFT calculations; and NP-complete problems.