CSE421: Introduction to Algorithms

Catalog Description: Techniques for design of efficient algorithms. Methods for showing lower bounds on computational complexity. Particular algorithms for sorting, searching, set manipulation, arithmetic, graph problems, pattern matching.
Prerequisites: either CSE 312 or CSE 322; either CSE 326 or CSE 332.
Credits: 3

Portions of the CSE 421 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 421 Web: © 1993-2013, Department of Computer Science and Engineering, University of Washington. Administrative information on CSE421 (authentication required).