【基礎排序】計數排序-簡潔版

#include <iostream>#include <assert.h>#include <time.h>using namespace std;void Sort(int A[], int n){    assert(n > 0);int max = A[0];for(int i=0; i<n; ++i){if(max < A[i]){max = A[i];}}    int *C = new int[max+1];memset(C,0,sizeof(int)*(max+1));    for (int j=0; j<n; j++)    {        C[A[j]]++;    }    int z = 0;    for (int k = 0; k <= max; k++)    {        while (C[k]-- > 0)        {            A[z++] = k;        }    }}void print(int a[],int n)        {            for(int i=0; i<n; i++)            {                cout<<a[i]<<" ";            }            cout << endl;        }                    void main()        {            int a[10];      srand((unsigned)time(NULL));//初始化隨機數         for(int i=0; i<10; i++)      {          a[i]=rand()%20;      }      cout << "排序前：";            print(a,sizeof(a)/sizeof(a[0]));                int n=sizeof(a)/sizeof(a[0]);          Sort(a,n);             cout << "排序後：";         print(a,sizeof(a)/sizeof(a[0]));        }