MIT's rigorous introduction to algorithms and data structures, free on OpenCourseWare. It covers the essential algorithms with real mathematical analysis, using Python. Excellent and demanding, though with no certificate and no graded feedback from the free materials.
Good for: Programmers who want a rigorous, university-level grounding in algorithms.
Less suitable if: You are new to programming, or you need a certificate.
Requirements: Programming experience and some maths; intermediate.
Realistic time: About 45 hours of lectures, plus practice.
About this course
6.006 is the undergraduate algorithms course at MIT — the same material, at the same pace, with the same problem sets and exams that MIT students take for credit. Taught by Erik Demaine and Jason Ku, it covers the algorithms and data structures foundational to computer science and software engineering interviews: sequence data structures, sorting algorithms, binary search trees, graphs, BFS and DFS, Dijkstra's and Bellman-Ford, dynamic programming, and complexity analysis.
What you'll learn
Analyze algorithm correctness and time/space complexity rigorously
Implement and compare sorting algorithms and understand their trade-offs
Work with binary search trees, heaps, and hash tables
Apply graph algorithms: BFS, DFS, Dijkstra's, and Bellman-Ford
Design dynamic programming solutions to optimization problems
This course includes
45h
On-demand video
Yes
Mobile access
English
Language
What it costs
Completely free through MIT OpenCourseWare, including lectures and assignments. There is no certificate.
Comparison · LBS
Compare alternatives for Introduction to Algorithms (6.006)
Same topic, different options. We surface the trade-offs others hide so you can pick the course that actually fits your time, budget, and goals.
MOMIT OpenCourseWare4.9(8,000)
Introduction to Algorithms (6.006)
Price
Free
Completely free, openly licensed — no certificate
Duration
45 hrs
Level
Intermediate
Certificate
FRfreeCodeCamp4.8(15,000)
JavaScript Algorithms and Data Structures Certification
Taught by Erik Demaine and Jason Ku, MIT faculty in theoretical computer science. Demaine is known for recreational mathematics and origami-inspired algorithms research.
About this provider
MO
MIT OpenCourseWare
MIT OpenCourseWare — free, openly licensed course materials from MIT's actual courses, including lecture notes, problem sets, and exams. No certificate.