[[
wikihub
]]
Search
⌘K
Explore
People
For Agents
Sign in
Explore
People
For Agents
Sign in
@jemoka / Jemoka Knowledge Base / wiki/courses/cs161.md
Suggest edit
Cancel
Submit suggestion
Title
Name
Note
--- title: "CS 161: Design & Analysis of Algorithms" type: course-overview source-count: 16 status: active confidence: high --- # CS 161: Design & Analysis of Algorithms Stanford course with 16 lecture notes. ## Lecture Timeline - **2025-09-23** — [SU-CS161 SEP232025](../raw/course/cs161/kbhsu_cs161_sep232025.md) - **2025-09-25** — [SU-CS161 SEP252025](../raw/course/cs161/kbhsu_cs161_sep252025.md) - **2025-09-30** — [SU-CS161 SEP302025](../raw/course/cs161/kbhsu_cs161_sep302025.md) - **2025-10-02** — [SU-CS161 OCT022025](../raw/course/cs161/kbhsu_cs161_oct022025.md) - **2025-10-07** — [SU-CS161 OCT072025](../raw/course/cs161/kbhsu_cs161_oct072025.md) - **2025-10-09** — [SU-CS161 OCT092025](../raw/course/cs161/kbhsu_cs161_oct092025.md) - **2025-10-14** — [SU-CS161 OCT142025](../raw/course/cs161/kbhsu_cs161_oct142025.md) - **2025-10-21** — [SU-CS161 OCT212025](../raw/course/cs161/kbhsu_cs161_oct212025.md) - **2025-10-23** — [SU-CS161 OCT232025](../raw/course/cs161/kbhsu_cs161_oct232025.md) - **2025-10-28** — [SU-CS161 OCT282025](../raw/course/cs161/kbhsu_cs161_oct282025.md) - **2025-10-30** — [SU-CS161 OCT302025](../raw/course/cs161/kbhsu_cs161_oct302025.md) - **2025-11-11** — [SU-CS161 NOV112025](../raw/course/cs161/kbhsu_cs161_nov112025.md) - **2025-11-13** — [SU-CS161 NOV132025](../raw/course/cs161/kbhsu_cs161_nov132025.md) - **2025-11-18** — [SU-CS161 NOV182025](../raw/course/cs161/kbhsu_cs161_nov182025.md) - **2025-11-20** — [SU-CS161 NOV202025](../raw/course/cs161/kbhsu_cs161_nov202025.md) - **2025-12-02** — [SU-CS161 DEC022025](../raw/course/cs161/kbhsu_cs161_dec022025.md) ## Key Topics Referenced - [[Amortized Analysis]] - [[Bellman Ford Algorithm]] - [[Bogo Sort]] - [[Depth First Search]] - [[Dynamic Programming]] - [[Floyd Warshall Algorithm]] - [[Graph]] - [[Greedy Algorithm]] - [[Hashing]] - [[Insertion Sort]] - [[K Select]] - [[Knapsack]] - [[Kosaraju S Algorithm]] - [[Las Vegas Algorithm]] - [[Longest Common Subsequence]] - [[Master Theorem]] - [[Merge Sort]] - [[Minimum Cut]] - [[Minimum Spanning Tree]] - [[Quicksort]] - [[Randomized Algorithum]] - [[Recurrence Relation]] - [[Sorting]] - [[Strongly Connected Components]] - [[Substitution Method]] - [[Worst Case Analysis]]