quadratic time

RU: квадратичное время

An algorithm runs in quadratic time, O(n²), when doubling the input size roughly quadruples the work. This typically arises from a nested loop where every element is compared with every other element. Bubble sort and insertion sort in their basic forms exhibit O(n²) in the worst and average cases.