计数排序（不基于比较的排序算法）

#include<iostream>
using namespace std;


void Counting_Sort(int a[], int b[], int n, int k)
{
    int *c = new int[k];
    for (int i = 0; i < k; i++)
        c[i] = 0;
    for (int i = 1; i <= n; i++)
        c[a[i]]++;
    for (int i = 1; i < k; i++)
        c[i] = c[i] + c[i - 1];
    for (int j = n; j >= 1; j--)
    {
        int u = a[j];
        int d = c[u];
        b[d] = a[j];
        c[u] = d - 1;
    }
}



void main()
{
    int a[11];
    int b[11];
    for (int i = 1; i < 11; i++)
        a[i] = 11 - i;
    Counting_Sort(a, b, 10, 11);
    for (int i = 1; i < 11; i++)
        cout << b[i] << endl;
}