计数排序的思想特别简单,就是记录下序列中每个元素出现的次数,然后根据保存次数的下标及出现次数将元素放回原数组。时间复杂度为O(N+数据范围),空间复杂度为O(最大数-最小数)。
代码实现:
#pragma once
int FindMax(int *array, const int size)
{
assert(NULL != array && size > 0);
int max = array[0];
for(int i = 1; i < (int)size; i++)
{
if(array[i] > max)
max = array[i];
}
return max;
}
int FindMin(int *array, const int size)
{
assert(NULL != array && size > 0);
int min = array[0];
for(int i = 1; i < (int)size; i++)
{
if(array[i] < min)
min = array[i];
}
return min;
}
void CountSort(int *array, const int size)
{
assert(NULL != array && size > 0);
if(size == 1)
return;
int max = FindMax(array, size);
int min = FindMin(array, size);
int *parr = new int[max-min+1]();
for(int i = 0; i < (int)size; i++)
parr[array[i]-min]++;
int index = 0;
for(int i = 0; i < max-min+1; i++)
if(parr[i] > 0)
for(int j = 0; j < parr[i]; j++)
array[index++] = min+i;
delete[] parr;
}
测试代码:
void test9()
{
int arr[100] = { 0 };
int sz = sizeof(arr) / sizeof(arr[0]);
srand((unsigned int)time(0));
for(int i = 0; i < sz; i++) //Assign values with random numbers
{
arr[i] = rand() % sz;
}
for(int i = 0; i < sz; i++) //print array
cout << arr[i] << " ";
cout << endl << endl << endl << "sort:" << endl;
CountSort(arr, sz); //sort
for(int i = 0; i < sz; i++) //print array
cout << arr[i] << " ";
cout << endl;
for(int i = 1; i < sz; i++) //check that the sort is correct
{
if(Less<int>()(arr[i], arr[i-1]))
cout << "sort error! " << arr[i] << endl;
}
}
运行效果图: