Implementing Counting sort C++

Counting sort is a technique which sorts input in o(n) time complexity if it falls in particular range. 
As the input falls in particular range, the counting method works well and can be rearranged easily.

Counting sort maintain count of each element appearing in the input then it places those in the order.

Code below sorts the input array A and returns B as a sorted array.  Even you can choose to return sorted data in same array by copying B data to input array.

typedef vector<int> IntVect; void CountingSort(IntVect & A, IntVect & B, int range) {     IntVect temp;     for (size_t i = 0; i < range; i++)     {         temp.push_back(0);     }     for (int i = 0; i < A.size(); i++)     {         temp[A[i]] += 1;     }     for (int i = 1; i < temp.size(); i++)     {         temp[i] += temp[i - 1];     }     for (int i = 0; i < A.size(); i++)     {         B[temp[A[i]] - 1] = A[i];         temp[A[i]] -= 1;     } }

Counting sort described here takes o(n) additional space.