Bucket sort

Bucket sort is a sorting algorithm that distributes elements into several "buckets" and then sorts those buckets individually. The basic idea behind bucket sort is to split the input data into a finite number of intervals, or "buckets," and then sort each bucket either using another sorting algorithm (like insertion sort or quicksort) or by recursively applying bucket sort on the contents of that bucket. Finally, the sorted buckets are concatenated to produce the final sorted list. ### How Bucket Sort Works 1.