Notation that describes how complex an algorithm is. A larger number inside of the Big-Oh notation means the algorithm takes longer to complete, a smaller number means the algorithm takes less time to complete. For example an algorithm that is described as O(n^2) would take longer than an algorithm that takes O(n), since for any value of n, n squared is larger than n.
