Bucket sort is an algorithm that divides unsorted array elements into buckets based on their value ranges. Each bucket is then sorted individually using another sorting algorithm. Finally, the sorted buckets are combined into a single sorted output array. Bucket sort works best when input values are uniformly distributed over a known range. It can also be useful for sorting floating point numbers. The algorithm involves creating buckets, inserting elements into the appropriate buckets based on their value, sorting each bucket, and concatenating the sorted buckets together.

1. Bucket Sort
Algorithm
BUCKET SORT IS A SORTING ALGORITHM THAT DIVIDES THE
UNSORTED ARRAY ELEMENTS INTO SEVERAL GROUPS
CALLED BUCKETS. EACH BUCKET IS THEN SORTED BY
USING ANY OF THE SUITABLE SORTING ALGORITHMS OR
RECURSIVELY APPLYING THE SAME BUCKET ALGORITHM.
FINALLY, THE SORTED BUCKETS ARE COMBINED TO FORM
A FINAL SORTED ARRAY.

2. Bucket Sort
Applications
BUCKET SORT IS USED WHEN:
•INPUT IS UNIFORMLY DISTRIBUTED OVER A
RANGE.
•THERE ARE FLOATING POINT VALUES

3. Sort
Initial array
10 buckets i.e an array of size 10 initialised with
value 0

4. Insert the unsorted elements in the buckets according to their
range
After all the elements are inserted in the buckets we can use
any sorting algorithm to sort these elements.
Here n=10,
Multiplying each value with n
then assigning its bucket

5. Sorted elements form the buckets are now inserted into the
original array by iterating through the buckets.

6. Bucket Sort Algorithm
bucketSort(arr[], n)
1) Create n empty buckets (Or lists).
2) Do following for every array element arr[i].
.......
Insert arr[i] into bucket[n*array[i]]
3) Sort individual buckets using stable sorting
algos
4) Concatenate all sorted buckets.