What's the complexity of for i: for o = i+1

Question

for i = 0 to size(arr)
   for o = i + 1 to size(arr)
      do stuff here

What\'s the worst-time complexity of this? It\'s not N^2, because the seco

Answer 1

It is N ^ 2, since it's the product of two linear complexities.

(There's a reason asymptotic complexity is called asymptotic and not identical...)

See Wikipedia's explanation on the simplifications made.