Beginner · Data
Big O notation
Visual diagram · (in preparation) · Math · (in preparation) · Worked example · 3 difficulty levels.
TL;DR. A mathematical notation used to describe the performance or complexity of an algorithm as input size grows.
Technical Definition
A mathematical notation used to describe the performance or complexity of an algorithm as input size grows.
How it works
Big O notation is a way to classify algorithms based on how their running time or space requirements grow with the input size. It provides an upper bound on the growth rate, helping developers understand and compare the efficiency of different algorithms, especially for large inputs.