void CountSort(int* a, int n)
{
assert(a);
int minValue = a[0];
int maxValue = a[0];
for (int i = 0; i < n; ++i)
{
if (minValue > a[i])
{
minValue = a[i];
}
if (maxValue < a[i])
{
maxValue = a[i];
}
}
int range = maxValue-minValue+1;
int* tmp = new int[range];
memset(tmp, 0, sizeof(int)*range);
int index = 0;
while (index < n)
{
tmp[a[index]-minValue]++;
++index;
}
index = 0;
for (int i = 0; i < range; ++i)
{
while (tmp[i]--)
{
a[index++] = i+minValue;
}
}
delete[] tmp;
}

售后响应及时
7×24小时客服热线
数据备份
更安全、更高效、更稳定
价格公道精准
项目经理精准报价不弄虚作假
合作无风险
重合同讲信誉,无效全额退款