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. Prerequisite: CSE 312; CSE 332.

Prerequisites: CSE 312; CSE 332
Credits: 3.0

---

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