Time Complexity

The complexity of:

int f(vector v)
{
   int sum = 0;
   for (int i = 0; i < v.size(); ++i)
   {
      for (int j=0; j < v.size(); ++j)
      {
         sum+=v[i];
      }
   }
   return sum;
}

is O(n**2).