worst case

RU: худший случай

The worst case of an algorithm is the specific input (or class of inputs) of a given size that maximises the resource cost — time or memory. It is an input scenario, not a notation: Big-O expresses an asymptotic upper bound on growth rate; the worst case names when that bound is actually achieved. Example: a sorted array is the worst case for naive quicksort.