Tuesday, November 30, 2010

Time Complexity

The complexity of

int f(vector v)
{
   int sum = 0;
   for (int i = 0; i < v.size()/2; ++i)
   {
      sum+=v[i];
   }return sum;
}
is O(n).

Note: O(1/2 n) is the same as O(n).

No comments:

Post a Comment