the amount of time an algorithm requires to run, as a function of the amount of input, measured in such a way as to ignore constant terms and multiplication by constant terms
Classical computers cannot sort a list of size n in less than O(n\,\log\, n) time.