Heaps and Priority Queues
Listed inHeaps and Priority QueuesData Structures & Algorithmson
The structure behind schedulers, top-k queries, and every "next thing to do" problem.
Intermediate6 minDraft
#structures
The handful of structures that cover almost everything, the complexity vocabulary to compare them, and when the theory stops predicting the benchmark.
11 articles
Listed inHeaps and Priority QueuesData Structures & Algorithmson
The structure behind schedulers, top-k queries, and every "next thing to do" problem.
Listed inProbabilistic StructuresData Structures & Algorithmson
Bloom filters, HyperLogLog, and count-min sketch — trading exactness for orders of magnitude.
Listed inTrees and Balanced TreesData Structures & Algorithmson
BSTs, red-black and B-trees, and why the database picked the one with the fat nodes.
Listed inRecursion and Dynamic ProgrammingData Structures & Algorithmson
Overlapping subproblems, memoisation, and turning an exponential solution into a table.
Listed inHash TablesData Structures & Algorithmson
Hashing, collision strategies, load factor, and the worst case that turns O(1) into O(n).
Listed inSorting and SearchingData Structures & Algorithmson
Comparison sorts, stability, binary search, and the off-by-one that survives every rewrite.
Listed inWhen Complexity Analysis LiesData Structures & Algorithmson
Cache misses, branch prediction, and allocator pressure — the constants that decide small n.
Listed inArrays and Linked ListsData Structures & Algorithmson
Contiguous versus linked storage, amortised growth, and why cache locality usually decides it.
Listed inGraphsData Structures & Algorithmson
Representations, BFS and DFS, shortest paths, and topological order for dependency problems.
Listed inChoosing a Data StructureData Structures & Algorithmson
Starting from the access pattern rather than the structure, and why an array usually wins.
Listed inBig-O NotationData Structures & Algorithmson
Asymptotic complexity as a comparison tool, and the constants it deliberately throws away.