Loading page · 正在加载页面
Loading page · 正在加载页面
Harvard University · CS 1200
算法及其局限性导论
Harvard's current introductory theory course combines algorithms, data structures, computational models, graph and logic algorithms, complexity, NP-completeness, and uncomputability, with rigorous proofs and analysis of correctness and efficiency.
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：2026
Language：English
Videos：Not verified
Assignments / solutions：Available / Available
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.
Harvard CS 1200 course team · verified 2026-08-22