升序排列数组

  1. function bucketSort(arr) {
  2.   const size = 5;
  3.   const maxValue = Math.max(...arr);
  4.   const minValue = Math.min(...arr);
  5.   const diff = maxValue - minValue;
  6.   const count = Math.floor(diff / size) + 1;
  7.   const buckets = [];
  9.   for (let i = 0; i < count; i++) {
  10.     buckets[i] = [];
  11.   }
  13.   for (let j = 0; j < arr.length; j++) {
  14.     const key = Math.floor((arr[j] - minValue) / size);
  15.     buckets[key].push(arr[j]);
  16.   }
  18.   let idx = 0;
  19.   for (let p = 0; p < buckets.length; p++) {
  20.     buckets[p].sort((a, b) => a - b);
  21.     while (buckets[p].length) {
  22.       arr[idx] = buckets[p].shift();
  23.       idx++;
  24.     }
  25.   }
  27.   return arr;
  28. }

算法测试

  1. console.log(bucketSort([6, 11, 1, 8, 32, 5]));
  2. // [ 1, 5, 6, 8, 11, 32 ]
  4. console.log(bucketSort([4, 7, 2, 5, 3, -1, 9, 0]));
  5. // [ -1, 0, 2, 3, 4, 5, 7, 9 ]
  7. console.log(bucketSort([-12, -3, 0, 4, 3, 9]));
  8. // [ -12, -3, 0, 3, 4, 9 ]