Data Structures and Big-O, Demystified
Data structures and Big-O without the jargon wall: every structure starts from an everyday thing (a coat check, a stack of plates, the line at the coffee…
Updated
Module 1: Why Organizing Matters
What data structures are and why organizing matters, the code the course uses in all five languages, and Big-O in plain words: counting steps, the growth-rate family, the doubling table, and measuring your own code.
- Welcome to Data Structures (4 topics, 7 lessons)
- The Code You Need (3 topics, 6 lessons)
- Big-O in Plain Words (4 topics, 10 lessons)
- Measuring and Trade-Offs (3 topics, 4 lessons)
Module 2: Things in a Line
Arrays, growing arrays, linked lists, stacks and queues: how each one works inside, what each operation costs, and the built-in versions in your language.
- Arrays and Growing Arrays (3 topics, 5 lessons)
- Linked Lists (2 topics, 4 lessons)
- Stacks and Queues (4 topics, 6 lessons)
Module 3: Recursion
Functions that call themselves: base cases, the call stack in pictures, recursion on nested data, recursion versus loops, and memoization.
- Thinking Recursively (2 topics, 4 lessons)
- Recursion at Work (3 topics, 4 lessons)
Module 4: Searching and Sorting
Linear and binary search, then sorting: selection, insertion, merge sort and quicksort, why n log n is the speed limit, and your language's built-in sort.
- Searching (2 topics, 3 lessons)
- Simple Sorts (2 topics, 3 lessons)
- Fast Sorts (3 topics, 5 lessons)
Module 5: Fast Lookup
Hash tables from the inside (hash functions, collisions, resizing), then sets and dictionaries in your language, good keys, and hash tables at work.
- Hash Tables (2 topics, 4 lessons)
- Sets and Dictionaries at Work (3 topics, 5 lessons)
Module 6: Trees and Heaps
Trees and how to walk them, binary search trees and why balance matters, B-trees and database indexes, heaps and priority queues, and tries.
- Trees (2 topics, 3 lessons)
- Binary Search Trees (2 topics, 4 lessons)
- Heaps and Tries (3 topics, 4 lessons)
Module 7: Graphs, and Choosing Well
Graphs, breadth-first and depth-first search, shortest paths and topological sort, then choosing the right structure and solving a problem out loud.
- Graphs (3 topics, 5 lessons)
- Graphs at Work (2 topics, 3 lessons)
- Choosing Well (3 topics, 4 lessons)