Priority queues are data structures that surface the most important item first. Learn how heaps power priority queues, where they appear in real systems, and how to implement them efficiently.
Tokens are the meter your model charges in: context, latency, and cost. We'll make tokenization visible using your existing local Ollama service—first via a CLI token inspector + heatmap, then with a live-updating browser playground.
A practical deep dive into Heap Sort—how binary heaps work, why heap sort guarantees O(n log n), and how it compares to quicksort, mergesort, and selection sort across real systems.
Run a local LLM on macOS, Linux, or Windows, call it over HTTP like a real service, stream output in Node/Python/Go/C++, and measure TTFT + throughput to understand what's actually happening.
A deep, honest exploration of Quick Sort—how partitioning creates order, why average-case performance beats guarantees, and how design choices shape real-world speed.
