What Is Big O Notation?

Imagine you are organizing a messy pile of books. If you only have five books, any method will be fast. But what if you have five million? In computer science, we need a way to measure how well an algorithm—a set of step-by-step instructions—performs as the size of the task grows from a handful to a mountain. This is where Big O notation comes in.

Big O notation is a mathematical shorthand used to describe the efficiency of an algorithm. Crucially, it does not measure speed in seconds, because a fast computer will always run code quicker than an old one. Instead, Big O measures scalability. It asks: how does the execution time or memory usage grow as the input size increases?

To make sense of this, programmers look at the worst-case scenario. For example, if you are searching for a specific name in an alphabetical list page by page, and the name is on the very last page, that is the worst-case. If the list has N items, you have to make N steps. In Big O, we call this linear time, written as O of N. If you use a smarter method, like flipping to the middle and cutting the search area in half repeatedly, the time grows much slower, written as O of log N. If you have to compare every single page with every other page, the complexity skyrockets to quadratic time, or O of N squared.

By using Big O notation, developers can predict how their software will behave under heavy loads. It is the ultimate tool for writing clean, efficient code that can scale gracefully from a local laptop to the entire global internet.