CS 161: Design & Analysis of Algorithms

Stanford course with 16 lecture notes.

Lecture Timeline

• 2025-09-23 — SU-CS161 SEP232025
• 2025-09-25 — SU-CS161 SEP252025
• 2025-09-30 — SU-CS161 SEP302025
• 2025-10-02 — SU-CS161 OCT022025
• 2025-10-07 — SU-CS161 OCT072025
• 2025-10-09 — SU-CS161 OCT092025
• 2025-10-14 — SU-CS161 OCT142025
• 2025-10-21 — SU-CS161 OCT212025
• 2025-10-23 — SU-CS161 OCT232025
• 2025-10-28 — SU-CS161 OCT282025
• 2025-10-30 — SU-CS161 OCT302025
• 2025-11-11 — SU-CS161 NOV112025
• 2025-11-13 — SU-CS161 NOV132025
• 2025-11-18 — SU-CS161 NOV182025
• 2025-11-20 — SU-CS161 NOV202025
• 2025-12-02 — SU-CS161 DEC022025

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