编辑代码

#include <bits/stdc++.h>
using namespace std;

//计数排序
void bucketSort(int arr[], int size, int maxnum) {
 vector<int> newarr(size);
 vector<int> bucket(maxnum + 1, 0);

 //进行计数
 for (int i = 0; i < size; i++)
  bucket[arr[i]]++;

 //进行输出
 for (int i = 0; i < maxnum; i++) {
  while (bucket[i]) {
   cout << i << " ";
   bucket[i]--;
  }
 }
}

int main() {
 int arr[10] = {78,17,39,26,72,94,21,12,23,68};
 int size = 10, maxnum = 100;
 bucketSort(arr, size, maxnum);
 return 0;
}