A counting sort algorithm

countSort.cpp

#include<iostream>
using namespace std;
void countingSort(int* data,int size,int value);

int main()
{
    int input[10]={1,6,5,0,7,2,9,3,4,8};
    int size=10,value=9;

    countingSort(input,size,value);
    for(int i=0;i<=size-1;i++) cout<<input[i]<<" ";
    return 0;
}

void countingSort(int* data,int size,int value)
{
    int counter[value+1],result[size];

    for(int i=0;i<=value;i++) counter[i]=0;
    for(int i=0;i<=size-1;i++) counter[data[i]]++;
    for(int i=1;i<=value;i++) counter[i]=counter[i]+counter[i-1];
    for(int i=size-1;i>=0;i--)
    {
        result[counter[data[i]]-1]=data[i];
        counter[data[i]]--;
    }
    for(int i=0;i<=size-1;i++) data[i]=result[i];
}