Lineartime

Mar 11, 2026 Engineering

Z-Algorithm: Linear-Time Pattern Matching

String matching is one of computing’s fundamental problems: given a pattern of length m and a text of length n, find all occurrences of the pattern within the text. The naive approach—sliding the…

Jan 29, 2025 Engineering

Counting Sort: Linear-Time Integer Sorting

Every computer science student learns that comparison-based sorting algorithms have a fundamental lower bound of O(n log n). This isn’t a limitation of our creativity—it’s a mathematical certainty…