CSE521: Design and Analysis of Algorithms ICatalog 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. CSE majors only.
Portions of the CSE 521 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 521 Web: © 1993-2013, Department of Computer Science and Engineering, University of Washington. Administrative information on CSE521 (authentication required).