Class BucketSort<T>

BucketSort is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm or by recursively applying the bucket sorting algorithm.

Bucket sort is mainly useful when input is uniformly distributed over a range. The algorithm has a time complexity of O(n + k) in the best and average case, where n is the number of elements and k is the number of buckets. The worst-case time complexity is O(n^2) when all elements are placed in the same bucket.

Note: This implementation is optimized for numeric values. For non-numeric types, consider using other sorting algorithms.

Example

const bucketSort = new BucketSort([0.42, 0.32, 0.33, 0.52, 0.37, 0.47, 0.51]);
bucketSort.sort(); // returns new array with [0.32, 0.33, 0.37, 0.42, 0.47, 0.51, 0.52]
// or
BucketSort.sort([0.42, 0.32, 0.33, 0.52, 0.37, 0.47, 0.51]); // returns new array with [0.32, 0.33, 0.37, 0.42, 0.47, 0.51, 0.52]
Copy

Example

const bucketSort = new BucketSort(
 [5, 3, 8, 6, 2, 7, 1, 4],
 (a : number, b : number) => a - b,
 10
);
bucketSort.sort(); // returns new array with [1, 2, 3, 4, 5, 6, 7, 8]
Copy