Knowledge
UnionFind
A different view on the dynamic connectivity problem through the lens of Quick-Find.
Queue
A practical application of a linked list which shines in scenarios requiring FIFO ordering.
Singly Linked List
The gateway to understanding linked data structures.
Bubble Sort
A quadratic-time algorithm that’s only useful as a teaching tool — but still has a few subtle properties.
Insertion Sort
A simple O(n²) sorting algorithm that is surprisingly fast on small or nearly sorted arrays.
Quick Sort
A divide-and-conquer sorting algorithm with excellent average performance and a dangerous worst case.
Ring Buffer
A ring buffer trades flexibility for predictability — and wins whenever allocations are the bottleneck.
Selection Sort
A simple O(n²) sorting algorithm with predictable behavior — and consistently poor performance.
Binary Search in Less Than a Minute
A simple algorithm whose correctness depends on precise invariants.