 Quadratic time

A time complexity bounded by $O(n^2)$ for input size $n$. Examining every ordered pair of entries with constant work per pair has this bound.