1#include <bits/stdc++.h>
2using namespace std;
3
4int cnt[1000001]; // 每个值出现的次数
5
6int main() {
7    int n;
8    scanf("%d", &n);
9    int a[100005];
10    int maxVal = 0;
11    for (int i = 0; i < n; i++) {
12        scanf("%d", &a[i]);
13        cnt[a[i]]++;
14        maxVal = max(maxVal, a[i]);
15    }
16
17    // 按桶的顺序收集
18    int idx = 0;
19    for (int v = 0; v <= maxVal; v++) {
20        while (cnt[v] > 0) {
21            a[idx++] = v;
22            cnt[v]--;
23        }
24    }
25
26    for (int i = 0; i < n; i++) printf("%d ", a[i]);
27    return 0;
28}

1#include <bits/stdc++.h>
2using namespace std;
3
4void bucketSort(vector<double>& a) {
5    int n = a.size();
6    if (n <= 1) return;
7
8    // 找到最大值和最小值
9    double minVal = *min_element(a.begin(), a.end());
10    double maxVal = *max_element(a.begin(), a.end());
11
12    // 创建 n 个桶
13    int bucketCount = n;
14    double bucketRange = (maxVal - minVal) / bucketCount + 1e-9;
15    vector<vector<double>> buckets(bucketCount);
16
17    // 分配元素到桶中
18    for (double x : a) {
19        int idx = (int)((x - minVal) / bucketRange);
20        if (idx >= bucketCount) idx = bucketCount - 1;
21        buckets[idx].push_back(x);
22    }
23
24    // 桶内排序
25    for (auto& bucket : buckets) {
26        sort(bucket.begin(), bucket.end());
27    }
28
29    // 收集结果
30    int k = 0;
31    for (auto& bucket : buckets) {
32        for (double x : bucket) {
33            a[k++] = x;
34        }
35    }
36}
37
38int main() {
39    vector<double> a = {0.42, 0.32, 0.23, 0.52, 0.25, 0.47, 0.51};
40    bucketSort(a);
41    for (double x : a) printf("%.2f ", x);
42    // 输出: 0.23 0.25 0.32 0.42 0.47 0.51 0.52
43    return 0;
44}