Algorithms and Data Structures
Learn how to implement sorting algorithms and data structures in JavaScript, and how to reason about the cost of each choice.
Big O Notation
Get familiar with the different runtimes that are possible for algorithms, from constant to exponential.
6 lessonsOpen the guide → 02
Algorithms
Learn about sorting algorithms, how they work, their implementation, and their runtimes.
OverviewRead the track → 03
Data Structures
Find out how to implement data structures such as linked lists, graphs, hash tables, and trees in JavaScript.
OverviewRead the track →Start with the cost, then the structure
Big O is the language we use to compare approaches. Once the notation is familiar, sorting algorithms and data structures become easier to reason about.
The code in these pages is plain JavaScript. Open your console and run it as you read. The goal is not memorizing the implementations, but seeing why each one behaves the way it does.