Learn · MIT OpenCourseWare

Prof. Demaine holds up a swirling origami figure.

Course6.00632 lectures

Introduction to Algorithms

Prof. Erik Demaine, Dr. Jason Ku and Prof. Justin Solomon · Massachusetts Institute of Technology

Start with lecture 1 At MIT OpenCourseWare

About

This course is an introduction to mathematical modeling of computational problems, as well as common algorithms, algorithmic paradigms, and data structures used to solve these problems. It emphasizes the relationship between algorithms and programming and introduces basic performance measures and analysis techniques for these problems.

Lectures

Lecture Videos

  1. Lecture 1: Algorithms and Computation 46 min · Video
  2. Lecture 2: Data Structures and Dynamic Arrays 51 min · Video
  3. Problem Session 1 1 h 27 min · Video
  4. Lecture 3: Sets and Sorting 53 min · Video
  5. Lecture 4: Hashing 53 min · Video
  6. Problem Session 2 1 h 28 min · Video
  7. Lecture 5: Linear Sorting 52 min · Video
  8. Problem Session 3 1 h 27 min · Video
  9. Lecture 6: Binary Trees, Part 1 51 min · Video
  10. Lecture 7: Binary Trees, Part 2: AVL 55 min · Video
  11. Problem Session 4 1 h 30 min · Video
  12. Lecture 8: Binary Heaps 51 min · Video
  13. Lecture 9: Breadth-First Search 53 min · Video
  14. Quiz 1 Review 1 h 26 min · Video
  15. Lecture 10: Depth-First Search 53 min · Video
  16. Lecture 11: Weighted Shortest Paths 58 min · Video
  17. Problem Session 5 1 h 29 min · Video
  18. Lecture 12: Bellman-Ford 58 min · Video
  19. Lecture 13: Dijkstra 58 min · Video
  20. Problem Session 7 Video
  21. Lecture 14: APSP and Johnson 57 min · Video
  22. Quiz 2 Review 1 h 23 min · Video
  23. Lecture 15: Dynamic Programming, Part 1: SRTBOT, Fib, DAGs, Bowling 58 min · Video
  24. Lecture 16: Dynamic Programming, Part 2: LCS, LIS, Coins 59 min · Video
  25. Problem Session 8 Video
  26. Lecture 17: Dynamic Programming, Part 3: APSP, Parens, Piano 1 h 4 min · Video
  27. Lecture 18: Dynamic Programming, Part 4: Rods, Subset Sum, Pseudopolynomial 1 h 4 min · Video
  28. Lecture 19: Complexity 1 h · Video
  29. Problem Session 9 Video
  30. Quiz 3 Review 1 h 24 min · Video
  31. Lecture 20: Course Review 56 min · Video
  32. Lecture 21: Algorithms—Next Steps 1 h · Video

Syllabus and materials

At MIT OpenCourseWare, as the course publishes them.

Credits and licence

Institution
Massachusetts Institute of Technology
Department
Electrical Engineering and Computer Science
Taught by
Prof. Erik Demaine, Dr. Jason Ku, Prof. Justin Solomon
Term
Spring 2020
Level
Undergraduate
Language
English
Subjects
Mathematics, Computer science, Engineering
Source
MIT OpenCourseWare
Licence
CC BY-NC-SA 4.0, as MIT OpenCourseWare states it. Non-commercial use only. MIT OpenCourseWare's terms
Attribution
Prof. Erik Demaine, Dr. Jason Ku, Prof. Justin Solomon. Introduction to Algorithms. Spring 2020. Massachusetts Institute of Technology: MIT OpenCourseWare, https://ocw.mit.edu/. License: Creative Commons BY-NC-SA.
Who can watch
MIT OpenCourseWare gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed