public class BucketSort implements IArraySort {
private static final InsertSort insertSort = new InsertSort();
public int[] sort(int[] sourceArray) throws Exception {
int[] arr = Arrays.copyOf(sourceArray, sourceArray.length);
return bucketSort(arr, 5);
private int[] bucketSort(int[] arr, int bucketSize) throws Exception {
} else if (value > maxValue) {
int bucketCount = (int) Math.floor((maxValue - minValue) / bucketSize) + 1;
int[][] buckets = new int[bucketCount][0];
for (int i = 0; i < arr.length; i++) {
int index = (int) Math.floor((arr[i] - minValue) / bucketSize);
buckets[index] = arrAppend(buckets[index], arr[i]);
for (int[] bucket : buckets) {
if (bucket.length <= 0) {
bucket = insertSort.sort(bucket);
for (int value : bucket) {
private int[] arrAppend(int[] arr, int value) {
arr = Arrays.copyOf(arr, arr.length + 1);
arr[arr.length - 1] = value;