CSE521: Design and Analysis of Algorithms I

Catalog Description: Principles of design of efficient algorithms: recursion, divide and conquer, balancing, dynamic programming, greedy method, data structure selection. Correctness and analysis of algorithms. Examples drawn from problems in sorting, searching, set manipulation, pattern-matching, graphs, matrices, polynomials, and integers.

Prerequisites: CSE major and CSE 326 or equivalent.
Credits: 4.0

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