仅仅提供代码实现,原理请问度娘。
1、 数据和工具类
module.exports.list = [9, 3, 4, 32, 42, 3, 45, 33, 2, 76, 89, 34];
module.exports.swap = function (list, i, j) {
let temp = list[i];
list[i] = list[j];
list[j] = temp;
};
module.exports.display = function (list) {
let str = "";
for (let i = 0; i < list.length; i++) {
str += list[i] + ", ";
}
console.log(str.replace(/, $/, ""));
};
2、桶排序实现
/**
* 桶排序
*/
const { list, swap, display } = require("./utils/common");
function bucketSort(list) {
if (!list || list.length <= 1) {
return;
}
//1、先获取 list 中数据的最大最小值
let min = list[0];
let max = min;
for (let i = 0; i < list.length; i++) {
if (min > list[i]) {
min = list[i];
}
if (max < list[i]) {
max = list[i];
}
}
//2、设置桶的数量
let space = 10;
let bucketCount = Math.ceil((max - min) / space);
let bucketList = [];
for (let i = 0; i < bucketCount; i++) {
bucketList.push([]);
}
//3、开始将数据放到对应的桶中。
for (let i = 0; i < list.length; i++) {
let value = list[i];
let index = Math.floor((value - min) / space);
bucketList[index].push(value);
}
//将所有的桶的内容合并
let resultList = [];
for (let i = 0; i < bucketCount; i++) {
let subList = bubbleSort(bucketList[i]);
resultList.push(...subList);
}
return resultList;
}
function bubbleSort(list) {
if (!list || list.length == 1) {
return list || [];
}
//外圈循环仅控制有几轮冒泡次数
for (let i = list.length - 1; i > 0; i--) {
for (let j = 1; j <= i; j++) {
if (list[j - 1] > list[j]) {
swap(list, j - 1, j);
}
}
}
return list;
}
let resultList = bucketSort(list);
display(resultList);