详解桶排序算法的思路及C++编程中的代码实现

[6 2 4 1 5 9]

[6 2 4 1 5 9]  待排数组

[0 0 0 0 0 0 0 0 0 0] 空桶

[0 1 2 3 4 5 6 7 8 9] 桶编号(实际不存在)

[6 2 4 1 5 9]  待排数组

[0 0 0 0 0 0 6 0 0 0] 空桶

[0 1 2 3 4 5 6 7 8 9] 桶编号(实际不存在)

[6 2 4 1 5 9]  待排数组

[0 0 2 0 0 0 6 0 0 0] 空桶

[0 1 2 3 4 5 6 7 8 9] 桶编号(实际不存在)

3,4,5,6省略,过程一样,全部入桶后变成下边这样

[6 2 4 1 5 9]  待排数组

[0 1 2 0 4 5 6 0 0 9] 空桶

[0 1 2 3 4 5 6 7 8 9] 桶编号(实际不存在)

1 2 4 5 6 9

#include<iostream>
#include<list>
#include<algorithm>
using namespace std;
 
void bucketsort(double* a, int n) {
 list<double>* b = new list<double>[n];
 for (int i = 0; i < n; i++) {
 b[int(a[i])].push_back(a[i]);
 }
 for (int i = 0; i < n; i++) {
 b[i].sort();
 }
 for (int i = 0,j=0; i < n; i++) {
 while (b[j].size() < 1)j++;
 a[i] = b[j].front();
 b[j].pop_front();
 }
}
 
int main() {
 double arr[] = {0.1,1.1,2.2,3.5,1.5,2.3,7.5,1.7};
 int n = 8;
 bucketsort(arr, n);
 for (int i = 0; i < 8; i++) {
 cout << arr[i] << " ";
 }
 cout << endl;
 return 0;
}