Skip to main content
No certificateIntermediateProgramming

6.006 Introduction to Algorithms

MIT's core algorithms course with Erik Demaine, Jason Ku and Justin Solomon.

Taught byMIT OpenCourseWare

About this course

The Spring 2020 edition of MIT's standard algorithms course. It covers how to model computational problems, data structures, sorting, hashing, graph algorithms, shortest paths and dynamic programming, with lecture videos, problem sets and exams.

Best for: Learners preparing for technical interviews or CS study.

What you will be able to do

  • Analyze algorithm running time
  • Choose suitable data structures
  • Apply graph and shortest-path algorithms
  • Solve problems with dynamic programming

Syllabus and your progress

Tick modules off as you finish them on MIT OpenCourseWare.

0 of 6 modules done

Plan your pace

At 4 hours a week you would finish in about 23 weeks, using the course time estimate above.

Progress is saved in this browser only. No account needed.

Cost and certificate

No certificate

OpenCourseWare offers no certificate.

Before you start: Intro programming in Python; Discrete mathematics

MIT OpenCourseWare sets the terms and can change them. Check the course page before you commit serious time, and tell us if something changed.

Quick answers

Is 6.006 Introduction to Algorithms really free?
Yes, the course material is free on MIT OpenCourseWare. OpenCourseWare offers no certificate.
How long does 6.006 Introduction to Algorithms take?
Plan for about 90 hrs in total (Editorial estimate; the provider does not publish a total. Full semester course.). It is video lectures, so you can go faster or slower.
Do I need experience before 6.006 Introduction to Algorithms?
It helps to have: Intro programming in Python; Discrete mathematics.

Featured in

Topics

About MIT OpenCourseWare

Actual MIT course materials, published openly.

All free MIT OpenCourseWare courses

6.006 Introduction to Algorithms

No certificate

Start on MIT OpenCourseWare