编辑代码

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void counting_sort(vector<int>& arr, int maxVal) {
	vector<int> bucket(maxVal + 1, 0);
	for (int& num : arr) {
		bucket[num]++;
	}
	int index = 0;
	for (int i = 0; i < maxVal + 1; i++) {
		while (bucket[i] > 0) {
			arr[index++] = i;
			bucket[i]--;
		}
	}
}
void print_arr(vector<int>& arr) {
	int n = arr.size();
	for (int i = 0; i < n; i++) {
		cout << arr[i] << "  ";
	}
	cout << endl;
}
int main() {
	vector<int> arr = {2,5,3,0,2,3,0,3};
	cout << "排序前：" << endl;
	print_arr(arr);
	counting_sort(arr,9);
	cout << "排序后：" << endl;
	print_arr(arr);
	system("pause");
	return 0;
}