Loading page · 正在加载页面
Loading page · 正在加载页面
Peking University · 00110060
算法设计与分析
A PKU course on complexity analysis, divide and conquer, greedy methods, dynamic programming, graph traversal, backtracking, NP-hardness, approximation, 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：Undergraduate
Suggested stage：Years 2–3 (inferred)
Public-material edition：Official course page (year not stated)
Language：Chinese
Videos：Not verified
Assignments / solutions：Not verified / 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.
Peking University School of Mathematical Sciences · verified 2026-08-22