Comparing Algorithms - Big O

From TRCCompSci - AQA Computer Science
Jump to: navigation, search

Big O Notation is a measure of how long or how much memory is needed to execute and algorithm. This uses the worst case scenario, so that you get the maximum time and memory usage. It uses n as the number of items.

Time complexities:

Constant complexity - O(1)
Linear complexity - O(n)
Logarithmic complexity - O(log n)
Linearithmic complexity - O(nlog n)
Polynomial complexity - O(nk)
Exponential complexity - O(kn)
Factorial complexity - O(n!)