bucket sort java implementation code example
Example 1: bucket sort java
public class Main
{
public static int[] bucket_sort(int[] arr, int max_value)
{
int[] bucket = new int[max_value + 1];
int[] sorted_arr = new int[arr.length];
for (int i= 0; i <arr.length; i++)
bucket[arr[i]]++;
int pos = 0;
for (int i = 0; i < bucket.length; i++)
for (int j = 0; j < bucket[i]; j++)
sorted_arr[pos++] = i;
return sorted_arr;
}
static int maxValue(int[] arr)
{
int max_value = 0;
for (int i = 0; i < arr.length; i++)
if (arr[i] > max_value)
max_value = arr[i];
return max_value;
}
public static void main(String args[])
{
int[] arr ={80, 50, 30, 10, 90, 60, 0, 70, 40, 20, 50};
int max_value = maxValue(arr);
System.out.print("\nOriginal : ");
System.out.println(Arrays.toString(arr));
System.out.print("\nSorted : ");
System.out.println(Arrays.toString(bucket_sort(arr,max_value)));
}
}
Example 2: bucket sort algorithm java
import java.util.ArrayList;
import java.util.Collections;
public class BucketSort {
public void bucketSort(float[] arr, int n) {
if (n <= 0)
return;
@SuppressWarnings("unchecked")
ArrayList<Float>[] bucket = new ArrayList[n];
for (int i = 0; i < n; i++)
bucket[i] = new ArrayList<Float>();
for (int i = 0; i < n; i++) {
int bucketIndex = (int) arr[i] * n;
bucket[bucketIndex].add(arr[i]);
}
for (int i = 0; i < n; i++) {
Collections.sort((bucket[i]));
}
int index = 0;
for (int i = 0; i < n; i++) {
for (int j = 0, size = bucket[i].size(); j < size; j++) {
arr[index++] = bucket[i].get(j);
}
}
}
public static void main(String[] args) {
BucketSort b = new BucketSort();
float[] arr = { (float) 0.42, (float) 0.32, (float) 0.33, (float) 0.52, (float) 0.37, (float) 0.47,
(float) 0.51 };
b.bucketSort(arr, 7);
for (float i : arr)
System.out.print(i + " ");
}
}