bucket sort using python

Bucket sort is an efficient sorting algorithm that works by distributing elements into a number of buckets, and then sorting the elements within each bucket. The resulting sorted elements are then concatenated back together to produce a final sorted list

Explanation of the code:

The bucket_sort() function takes in a single argument, arr, which is the list of elements to be sorted.
The function creates n empty buckets using a list comprehension.
The elements of the input list are then inserted into the appropriate bucket using the int(n*arr[i]) expression. The number of buckets is equal to the length of the input list, and the value of each element is used to determine which bucket it should be placed in.
The elements within each bucket are then sorted using the built-in sorted() function.
The sorted elements within each bucket are then concatenated together to form the final sorted list, which is returned by the function.