学步园

#include <iostream><br /> #define Length 8<br /> #define super 100000<br /> using namespace std;<br /> void Counting_Sort(int A[],int B[],int k)<br /> {<br /> int C[6]={0};<br /> //C[i]包含等于i的元素个数<br /> for(int j=1;j<=Length;++j)<br /> {<br /> C[A[j]] += 1;<br /> }<br /> //C[i]包含小于等于i的元素个数<br /> for(int i=1; i<6; ++i)<br /> {<br /> C[i] = C[i]+C[i-1];<br /> }<br /> for(int j=Length; j>0;j--)<br /> {<br /> B[C[A[j]]] = A[j];<br /> C[A[j]]=C[A[j]] - 1;<br /> }<br /> }<br /> //输出数组中的元素<br /> void printArray(int *A)<br /> {<br /> for(int i=1; i<=Length;++i)<br /> {<br /> cout << *(A+i)<<" ";<br /> }<br /> }<br /> int main()<br /> {<br /> int a[]={super,2,5,3,0,2,3,1,3};<br /> int b[Length]={super,0,0,0,0,0,0,0};<br /> cout << "排序前:"<<endl;<br /> printArray(a);<br /> Counting_Sort(a,b,5);<br /> cout <<endl<< "排序后:"<<endl;<br /> printArray(b);<br /> return 0;<br /> }<br />