COM SCI 180: Introduction to Algorithms and Complexity
Introduction to design and analysis of algorithms. Design techniques: divide-and-conquer, greedy method, dynamic programming; selection of prototypical algorithms; choice of data structures and representations; complexity measures: time, space, upper, lower bounds, asymptotic complexity; NP-completeness.
4 units, lecture, discussion
Loading...
| ELIEZER M GAFNI | Winter 2022 | 25 | 52.0% (13) |
|---|---|---|---|
| CHO-JUI HSIEH | Winter 2023 | 191 | 49.2% (94) |
| RAFAIL OSTROVSKY | Winter 2026 | 246 | 46.3% (114) |
| GLENN D REINMAN | Fall 2024 | 234 | 43.2% (101) |
| MAJID SARRAFZADEH | Fall 2025 | 173 | 40.5% (70) |
| SANDRA BATISTA | Spring 2026 | 178 | 33.7% (60) |
A-range % and grade counts cover only each instructor’s latest recorded term, shown in the "Latest Data From" column, combining all sections for the course. A-range % is the share of recorded letter grades (A+ through F) that are A+, A, or A−. Parentheses show the A-range count over the total letter-grade count. P/NP and incompletes are excluded. Records may be incomplete.
- Available Academic Terms
- Fall 2021 · Winter 2022 · Spring 2022 · Fall 2022 · Winter 2023 · Spring 2023 · Fall 2023 · Winter 2024 · Spring 2024 · Summer 2024 · Fall 2024 · Winter 2025 · Spring 2025 · Fall 2025 · Winter 2026 · Spring 2026