Introduction to Algorithms (6.006)
Erik Demaine, Srinivas Devadas
Master fundamental algorithms with MIT's 6.006 course, taught by Demaine & Devadas. Explore key concepts and problem-solving techniques!
More resources on Algorithms
Introduction to Algorithms (CLRS)
The gold-standard reference for algorithmic rigor and complexity intuition, training the muscle of choosing the right trade-offs under constraints.
Algorithms, Part I
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms. All the features of this course are available for free. People who are interested in digging deeper into the content may wish to obtain the textbook Algorithms, Fourth Edition (upon which the course is based) or visit the website algs4.cs.princeton.edu for a wealth of additional material. This course does not offer a certificate upon completion.
Structure and Interpretation of Computer Programs (SICP)
The 'Wizard Book' of CS; teaches the fundamental principles of abstraction and computational logic.
Algorithm Visualizer
Free tool to visualize sorting and graph algorithms
MIT 6.006 Lecture 1: Algorithms and Asymptotics
MIT intro algorithms lecture series start
Advanced Algorithms
Master advanced algorithms with this comprehensive course by Srinivas Devadas. Explore design and analysis techniques.