ViewTube

How graph representations actually live in memory — the byte-level layout behind the abstraction. We map the abstract picture ...

How graph algorithms actually live in memory — the byte-level layout behind the abstraction. We map the abstract picture onto ...

A tight recap of searching: the mental model, the operations, and the costs — everything worth keeping. The essential takeaways ...

Practice with graph representations: work the problems yourself, then check the worked solutions. Hands-on exercises to turn ...

The cost of sorting and searching, operation by operation — big-O, and the traps that bite in practice. We build the complexity ...

Before the how, the why: what problem sorting and searching solve, and what it costs you to get them wrong. We start from a ...

Selection Sort, end to end: how it sorts, why it's correct, and what it costs. We watch the algorithm run on a real array, then write it ...

Practice with graph algorithms: work the problems yourself, then check the worked solutions. Hands-on exercises to turn ...

Before the how, the why: what problem range query structures solve, and what it costs you to get them wrong. We start from a ...

Quicksort, end to end: how it sorts, why it's correct, and what it costs. We watch the algorithm run on a real array, then write it in C ...

Insertion Sort, end to end: how it sorts, why it's correct, and what it costs. We watch the algorithm run on a real array, then write it in ...

Segment Tree: build, query, point-update — how it works, step by step, with a memory diagram and real C code. We build it up ...

We walk the operation one move at a time, watch it in memory, write it in C, and work out its cost. What you'll learn: • How insertion ...

Before the how, the why: what problem graph traversal solves, and what it costs you to get it wrong. We start from a concrete ...

Prefix Sums: build and query — how it works, step by step, with a memory diagram and real C code. We build it up from the idea, ...

Merge Sort, end to end: how it sorts, why it's correct, and what it costs. We watch the algorithm run on a real array, then write it in C ...

Heap Sort, end to end: how it sorts, why it's correct, and what it costs. We watch the algorithm run on a real array, then write it in C ...

Fenwick Tree: update and prefix-query — how it works, step by step, with a memory diagram and real C code. We build it up from ...

Practice with tries: work the problems yourself, then check the worked solutions. Hands-on exercises to turn understanding into ...

Before the how, the why: what problem graph algorithms solve, and what it costs you to get them wrong. We start from a concrete ...