How is the complexity O(n2)?

#1

int sum = 0;
void calcSum(vector v, int i)
{
if(i == v.size())
return;
sum += v[i];
calcSum(v, i+1);
}

#2

vector is passed by value so it is copies n times and it takes n time to copy so n2