Time Complexity

The complexity of

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

is O(log n).