Snippet of Insertion Sort in C++

void InsertionSort(long *data, long n)
{
    long i, j, item;
    for(i=1;i<n;i++)
    {
        item = data[i];
        for(j=i; (j > 0) && (data[j-1] > item); j--)
  {
            data[j] = data[j-1];
  }
        data[j] = item;
    }
}