#include <iostream>
using namespace std;
#define len 5
void countSorting(int A[],int B[],int k ){
int C[k + 1] = {0};
for(size_t i = 0;i != len;++i)
++C[A[i]];
for(size_t i = 1 ;i != k + 1;++i)
C[i] += C[i - 1];
for(size_t i = len - 1; i != -1;--i){
B[C[A[i]] - 1] = A[i];//跟书上不同,一定要 -1,因为B[]是从 0 开始的
--C[A[i]];
}
}
int main()
{
int a[5] = {4,4,1,3,3};
int b[5] = {0};
countSorting(a,b,4);
for(int i = 0; i != 5;++i)
cout << b[i] << ' ';
cout << endl;
return 0;
}
算法导论计数排序实现(C++)
最新推荐文章于 2023-06-03 22:40:51 发布