Algorithm Analysis — free lessons (Data Structures and Algorithms)
- Introduction to Algorithms - Problem Session 1: Asymptotic Behavior of Functions and Double-ended... — MIT OpenCourseWare (87 min)
- Lecture 1: Algorithmic Thinking, Peak Finding — MIT OpenCourseWare (53 min)
- Recitation 1: Asymptotic Complexity, Peak Finding — MIT OpenCourseWare (54 min)
- R1. Matrix Multiplication and the Master Theorem — MIT OpenCourseWare (54 min)
- 1. Algorithms and Computation — MIT OpenCourseWare (46 min)
- 2. Divide & Conquer: Convex Hull, Median Finding — MIT OpenCourseWare (81 min)
- 3. Divide & Conquer: FFT — MIT OpenCourseWare (81 min)
- R2. 2-3 Trees and B-Trees — MIT OpenCourseWare (31 min)
- Meet the Educator — MIT OpenCourseWare (3 min)
- Stanford CS149 I 2023 I Lecture 3 - Multi-core Arch Part II + ISPC Programming Abstractions — Stanford Online (76 min)
- 1. Persistent Data Structures — MIT OpenCourseWare (84 min)
- Lecture 1 | Programming Abstractions (Stanford) — Stanford (43 min)
- 2. Retroactive Data Structures — MIT OpenCourseWare (79 min)
- Lecture 2: Models of Computation, Document Distance — MIT OpenCourseWare (49 min)
- Lecture 2 | Programming Abstractions (Stanford) — Stanford (44 min)
- 3. Geometric Structures I — MIT OpenCourseWare (80 min)
- Lecture 3 | Programming Abstractions (Stanford) — Stanford (45 min)
- Lecture 4 | Programming Abstractions (Stanford) — Stanford (50 min)