What is the worst-case complexity of the sumUp function?

class OddSum { private: 

 int* counts; int nC; public: 

 NameCounter (int nCounts, int nNames); 

 int sumUp() const; 

 ... 

}; 

int NameCounter::sumUp () { int sum = 0; for (int i = 1; i < nC-1; ++i) 

 for (int j = i-1; j <= i+1; ++j) sum += counts[j]; return sum; }