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
It's n*(n-1)/2 which is equal to O(n^2).
n*(n-1)/2
O(n^2)