int f(vectoris O(n**2).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; }
Tuesday, November 30, 2010
Time Complexity
The complexity of:
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment