What Is Big O Notation? Explained Simply

What Big O is

Big O notation is a way of describing how the running time or memory use of an algorithm grows as the size of its input increases. It does not measure exact seconds, which depend on the machine, but the rate of growth: if you double the data, does the work double, quadruple, or barely change? Big O gives a hardware-independent way to compare algorithms and reason about how they will behave as data scales up.

Why growth rate matters

For small inputs, almost any algorithm is fast enough. The differences appear at scale. An approach that is fine for a hundred items might be hopelessly slow for a million. Big O focuses on this scaling behavior because that is what determines whether software stays responsive as it grows. It deliberately ignores constant factors and small details to highlight the dominant trend, which is what matters most for large inputs.

Common classes

A few Big O classes come up constantly. O(1), 'constant time,' means the work does not grow with input size at all. O(n), 'linear time,' means work grows in direct proportion, double the data, double the work. O(log n), 'logarithmic time,' grows very slowly and is excellent, typical of efficient searches. O(n squared), 'quadratic time,' grows steeply and becomes slow quickly, often seen in naive approaches that compare every item to every other.

A concrete feel

Imagine searching for a name. Checking every entry one by one is O(n): a list ten times longer takes about ten times as long. But searching a sorted list by repeatedly halving the search space (binary search) is O(log n): even a list a thousand times longer takes only about ten more steps. That gap is why algorithm choice matters enormously at scale, and Big O is the language for describing it.

Time and space

Big O describes not just time but also space, how much extra memory an algorithm needs as input grows. Sometimes there is a trade-off: you can make an algorithm faster by using more memory, or save memory at the cost of speed. Big O lets developers reason about both dimensions. Analyzing an algorithm often means stating both its time complexity and its space complexity in Big O terms.

Why it matters

Big O notation is a core tool for writing software that scales. It helps developers predict how code will perform on large inputs before running it, choose the right algorithm for a job, and spot approaches that will not hold up. Even at a conceptual level, understanding Big O builds intuition for why some programs stay fast while others grind to a halt as data grows, a key part of thinking like an engineer.

Related on Skillo

See also: What is an algorithm? Explained simply, What is recursion? Explained simply.

Sources

• Big O notation - Wikipedia

Published date reflects the original event date (2025-01-28). This article is original Skillo editorial written from the sources above; facts were verified in September 2026.