Knowledge

Algorithms Architecture Data Structures SQL

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.

→