MIT 6.006 Introduction to Algorithms
Erik Demaine, Srinivas Devadas
Learn algorithm complexity and fundamental data structures with MIT's 6.006 Intro to Algorithms, taught by Demaine & Devadas.
More resources on Algorithm Complexity
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.
Complexity Zoo
Comprehensive list of complexity classes.
Visualgo
Interactive visualizations of algorithms and complexity.
Big-O Cheat Sheet
Quick reference for algorithm complexities.
freeCodeCamp - Big O Notation
Beginner-friendly crash course.
mycodeschool - Analysis of Algorithms
Playlist starter on complexity analysis.