CSOR E4231
ANALYSIS OF ALGORITHMS I
Introduction to the design and analysis of efficient algorithms. Topics include models of computation, efficient sorting and searching, algorithms for algebraic problems, graph algorithms, dynamic programming, probabilistic methods, approximation algorithms, and NP-completeness.
Topics
- models of computation
- efficient sorting and searching
- algorithms for algebraic problems
- graph algorithms
- dynamic programming
- probabilistic methods
- approximation algorithms
- and NP-completeness
Topics explicitly listed in official catalogue description
Prerequisites & course information
Prerequisites: ( COMS W3134 and COMS W3136 ) or ( COMS W3137 and COMS W3203 )
Sources
- Course catalogue ↗2026-2027