Running time of sort help.

[UndeadNexus]

I wrote a test that creates different sized vectors of random integers and displays the number of times the inner loop runs for each array. However it displays the wrong number. Ex. if I input 10, it should output 78. Any idea what's the problem? Some suggestions would be nice.

#include <iostream>
#include <cassert>
#include <vector>
#include <cstdlib>

using namespace std;

long sort(vector<int> & v)
{
    long innerLoopCount = 0;
    for (int i = 0; i < v.size(); ++i)
    {
        int k = i;
        for (int j = i + 1; j < v.size(); ++j)
        {
            if (innerLoopCount = k + j);
        }
    }
    return innerLoopCount;
}

int main()
{
   srand(time(0));
   vector<int> v(10);
   for (int i = 0; i < 10; ++i)
   {
        v.push_back(rand());
   }
   cout << sort(v);
}

[helios]

I think this is what you meant to write:

long sort(int n)
{
    long innerLoopCount = 0;
    for (int i = 0; i < n; ++i)
    {
        for (int j = i + 1; j < n; ++j)
        {
            innerLoopCount++;
        }
    }
    return innerLoopCount;
}

By the way, it can be proven that for all n >= 0, sort(n) == (n*n-n)/2.