# Big Oh

often mistaken to mean worst case complexity because the analysis is done using worst case it actually means the running time is upper bounded by f(n)

often mistaken to mean worst case complexity because the analysis is done using worst case it actually means the running time is upper bounded by f(n)