Stanford University · CS161

Design and Analysis of Algorithms

算法设计与分析

Algorithm design and analysis using mathematical reasoning, probability, and data structures.

Subject：Algorithms

Level：Undergraduate

Suggested stage：Years 2–3 (inferred)

Public-material edition：2026

Language：English

Videos：Not verified

Assignments / solutions：Not verified / Not verified

Prerequisites

Stanford CS 103 →Stanford CS 109 →Programming Abstractions or equivalent →

Start here

All official course content

Lectures, video, assignments and exams are separated so you do not have to hunt through the course homepage.

28 direct tasks

▶Lectures, video & readingCourse content in the official sequence14

Topic 1: Asymptotic Analysis Topic 2: Divide and Conquer Topic 3: Randomized Algorithms Topic 4: Sorting and Selection Topic 5: Hashing Topic 6: Graph Search Topic 7: Shortest Paths Topic 8: Minimum Spanning Trees Topic 9: Greedy Algorithms Topic 10: Dynamic Programming Topic 11: Network Flow Topic 12: Linear Programming Topic 13: NP-Completeness Topic 14: Approximation Algorithms

✓Assignments & practiceOpen the matching problem or assignment page14

Official resource hubs

Use these to browse a complete resource collection; the section above links directly to individual study items.

Course information and prerequisitesStanford Computer Science ↗

Source and verification

Every link points to an official university or course-team page. The year identifies the linked public-material edition, not necessarily the latest on-campus offering; a school may have newer materials that are not public. Unknown facts remain unverified rather than guessed.

Stanford Computer Science · verified 2026-07-31

Open official course ↗Report a resource issue