Big O notation

In mathematics and computer science, **Big O notation** is a way of comparing rates of growth of different functions. It is often used to compare the efficiency of different algorithms, which is done by calculating how much memory is needed, and how much time it takes to complete.

The Big O notation is often used in identifying how complex a problem is, also known as the problem's complexity class. The mathematician Paul Bachmann (1837-1920) was the first to use this notation, in the second edition of his book "Analytische Zahlentheorie", in 1896. Edmund Landau (1877-1938) made the notation popular. For this reason, when people talk about a **Landau symbols**, they refer to this notation.

Big O notation is named after the term "order of the function", which refers to the growth of functions. Big O notation is used to find the upper bound (the highest possible amount) of the function's growth rate, meaning it works out the longest time it will take to turn the input into the output. This means an algorithm can be grouped by how long it can take in a worst-case scenario, where the longest route will be taken every time.

More specifically, given two positive functions  and , we say that  is in the big O of  (written ) if for large enough ,  for some constant .

Big O is an expression that finds worst-case scenario run-time, showing how efficient an algorithm is without having to run the program on a computer. This is also useful due to the fact that different computers may have different hardware, and therefore need different amounts of time to complete it. Since Big O always assumes the worst-case, it can show a consistent measurement of speed: regardless of the hardware,  is always going to complete faster than , because they have different levels of efficiency.

## Examples

The following examples all use code written in Python. Note that this is not a complete list of Big O types.

### Constant

always takes the same amount of time regardless of input. For example, take a function that accepts an integer (called x) and returns double its value:

After accepting the input, this function will always take one step to return an output. It is constant because it will always take the same amount of time, so it is .

### Linear

increases according to the size of the input, represented by . For example, for the following function that accepts n and returns every number from 1 to n:

If we were to input the value of 5, then this would output , requiring 5 loops to complete. Similarly, if we input 100, then it would output , requiring 100 loops to complete. If the input is , then the algorithm's run time is exactly  loops every time, therefore it is .

### Factorial

increases in factorial amounts, meaning the time taken increases massively with the input. For example, say we wish to visit five cities around the world and want to see every possible ordering (permutation). An algorithm we could write using Python's itertools library is as follows:

This algorithm will calculate each unique permutation of our cities and then output it. Examples of output will include:

<pre>('London', 'Paris', 'Berlin', 'Amsterdam', 'Rome')
('London', 'Paris', 'Berlin', 'Rome', 'Amsterdam')
('London', 'Paris', 'Amsterdam', 'Berlin', 'Rome')
...
('Rome', 'Amsterdam', 'Paris', 'Berlin', 'London')
('Rome', 'Amsterdam', 'Berlin', 'London', 'Paris')
('Rome', 'Amsterdam', 'Berlin', 'Paris', 'London')</pre>

Here, our input list is 5 items long, and for every selection our remaining options decreases by 1. In other words, our 5 inputs choose  items (or ). If our input is  cities long, then the number of outputs is ; in general, assuming that we go through every permutation, then we will require  loops to complete it.

### Logarithmic

increases in logarithmic time. This commonly appears in binary search operations.

Each iteration halves the search space (right - left). If n is the array length, the number of iterations is log₂(n) because you divide by 2 until the space is 1 or 0. Hence, O(log n).

### Exponential

increases in exponential time. This commonly occurs in recursive and brute force operations.

Each call branches into two recursive calls, and the recursion depth is n. The total number of calls forms a binary tree of depth n, with approximately 2^n nodes (operations). Hence, O(2^n).

## Little-o notation

A related concept to big-O notation is little-o notation. Big-O is used to say that a function does not grow faster than another function, while little-o is used to say that a function grows slower than another function. If two functions grow at the same rate, big-O can be used but little-o cannot. The difference between big-O and little-o is similar to the difference between   and .

- If  grows slower than , then  and .
- If  grows at the same rate as , then  but .
- If  grows faster than , then  and .