average case

Is Big O Notation The Worst Case? Big-O, commonly written as O, is an Asymptotic Notation for the worst case, or ceiling of growth for a given function. It provides us with an asymptotic upper bound for the growth rate of the runtime of an algorithm. Why is Big O used for worst case? Worst-case