Time complexity of the recursive problem

int sum = 0;
void calcSum(vector v, int i)
{
if(i == v.size())
return;
sum += v[i];
calcSum(v, i+1);
}
why is its time complexity O(N^2)?

because vector is not passed by reference
so copying the vector will also take O(N) time