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.

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.

Module 3: Recursion

Functions that call themselves: base cases, the call stack in pictures, recursion on nested data, recursion versus loops, and memoization.

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.

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.

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.

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.