International Students Apply Early
We advise all international students who require an I-20 from Stanford to apply as early as possible.
Design and Analysis of Algorithms
JUNE 22, 2026 — AUGUST 13, 2026
CS161
Details:
Time: No Topic - No Type
Units: 5
Class Number: 11489
Interest Area: Computer Science and Engineering
Instructor: 1 Staff
Population: Undergraduate, Graduate
Interest Area: Computer Science and Engineering
Course Format & Length: In Person, 8 Weeks
Pre-requisites:
Pre-requisites
We expect visiting students to have knowledge that is equivalent to the listed Stanford pre-requisite course.
Cross Listing: -
Grading Basis: Letter or Credit/No Credit
Description:
Worst and average case analysis. Recurrences and asymptotics. Efficient algorithms for sorting, searching, and selection. Data structures: binary search trees, heaps, hash tables. Algorithm design techniques: divide-and-conquer, dynamic programming, greedy algorithms, amortized analysis, randomization. Algorithms for fundamental graph problems: minimum-cost spanning tree, connected components, topological sort, and shortest paths. Possible additional topics: network flow, string searching.
Course notes:
Stanford graduate students may enroll in course for 3 or 4 units; all other students must enroll in 5 units.
Favorites List
Your favorites list is empty. Tap the icon on courses you’re interested in to see them here, and share them with family and friends.