Completed
21. Algorithms—Next Steps
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Introduction to Algorithms
Automatically move to the next video in the Classroom when playback concludes
- 1 1. Algorithms and Computation
- 2 2. Data Structures and Dynamic Arrays
- 3 Introduction to Algorithms - Problem Session 1: Asymptotic Behavior of Functions and Double-ended...
- 4 3. Sets and Sorting
- 5 4. Hashing
- 6 Problem Session 2 (MIT 6.006 Introduction to Algorithms, Spring 2020)
- 7 5. Linear Sorting
- 8 Problem Session 3
- 9 6. Binary Trees, Part 1
- 10 7. Binary Trees, Part 2: AVL
- 11 Problem Session 4
- 12 8. Binary Heaps
- 13 9. Breadth-First Search
- 14 Quiz 1 review
- 15 10. Depth-First Search
- 16 11. Weighted Shortest Paths
- 17 Problem Session 5
- 18 12. Bellman-Ford
- 19 Problem Session 6
- 20 13. Dijkstra
- 21 Problem Session 7
- 22 14. APSP and Johnson
- 23 Quiz 2 Review
- 24 15. Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling
- 25 16. Dynamic Programming, Part 2: LCS, LIS, Coins
- 26 Problem Session 8
- 27 17. Dynamic Programming, Part 3: APSP, Parens, Piano
- 28 18. Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial
- 29 19. Complexity
- 30 Quiz 3 Review
- 31 20. Course Review
- 32 21. Algorithms—Next Steps
