Loading page · 正在加载页面
Loading page · 正在加载页面
Tsinghua University · 2018122106X
算法设计与分析
A Tsinghua advanced course covering stable matching, asymptotic analysis, graph traversal, greedy methods, divide and conquer, dynamic programming, network flow, NP-completeness, approximation, local search, and randomized algorithms.
Start with one small step
No path choice or account is required. Start one real official item and OpenStudy will remember where you left off.
Subject：Algorithms
Level：Advanced Undergraduate
Suggested stage：Years 3–4 (inferred)
Public-material edition：2026
Language：Chinese
Videos：Available
Assignments / solutions：Available / Not verified
Start here
Lectures, video, assignments and exams are separated so you do not have to hunt through the course homepage.
Use these to browse a complete resource collection; the section above links directly to individual study items.
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.
National Higher Education Smart Education Platform · Tsinghua University · verified 2026-08-26