COMP 2080
Algorithms: Design and Implementation
Techniques for algorithm design: divide-and-conquer, greedy, dynamic programming, and randomization. Analysis of recursive algorithms through recurrence relations. The design and implementation of common algorithms such as sorting and selection.
Prerequisites & course information
PR/CR: A minimum grade of C is required unless otherwise indicated. Prerequisites: COMP 2140 and [one of MATH 1240 , MATH 1241 , or the former COMP 2130] and [one of STAT 1150 , STAT 2000 (B), STAT 2001 (B), STAT 2220 , or PHYS 2496 ]. Attributes: Science
Sources
- Course catalogue ↗2026-2027