What is the Big Oh of calc, in term of n, the size of array v, when n is big enough?

int subcalc2(int[] v2) {

int sum = 0;

for (int i = 0; i < v2.length; i++)

for (int j = 0; j < i; j++)

sum = sum + v2[i] * v2[j];

return sum;

}

int calc(int[] v) {

return subcalc1(v) + subcalc2(v);

}