package sortingAlgorithms;

//Program Title => Java program to sort an arrays.array using bucket sort.

import java.util.*;

import java.util.Collections;

class Bucket_Sort {

// Function to sort arr[] of size n using bucket sort

static void bucketSort(float[] arr, int n) {

if (n <= 0)

return;

// 1) Create n empty buckets

@SuppressWarnings("unchecked")

Vector<Float>[] buckets = new Vector[n];

for (int i = 0; i < n; i++)

buckets[i] = new Vector<>();

// 2) Put arrays.array elements in different buckets

for (int i = 0; i < n; i++) {

float idx = arr[i] * n;

buckets[(int)idx].add(arr[i]);

}

// 3) Sort individual buckets

for (int i = 0; i < n; i++)

Collections.sort(buckets[i]);

// 4) Concatenate all buckets into arr[]

int index = 0;

for (int i = 0; i < n; i++) {

for (int j = 0; j < buckets[i].size(); j++)

arr[index++] = buckets[i].get(j);

}

}

// Driver code

public static void main(String[] args) {

float[] arr = {

(float)0.897, (float)0.565,

(float)0.656, (float)0.1234,

(float)0.665, (float)0.3434

};

int n = arr.length;

bucketSort(arr, n);

System.out.println("Sorted arrays.array is ");

for (float el : arr)

System.out.print(el + " ");

}

}