Updated April 12, 2023

## Introduction to Bucket Sort Python

Bucket sort in Python is defined as a comparison type of algorithm which is used for sorting data or elements which are uniformly distributed with a certain range where the given elements of the array or list are allocated in buckets or bins where later these elements in the buckets are sorted in order and such arrangement of given elements is known as bucket sort which is also known as bin sort. In general, the bucket sort algorithm is defined as arranging the scattered elements which are assigned in the buckets are sorted in a particular order, and then these scattered elements are gathered ad sorted resulting in a new list.

**Syntax:**

As bucket sort is a type of algorithm therefore it will have an algorithm instead of syntax in any programming language. Therefore let us see the algorithm below:

**Algorithm:**

**Step 1:** Given an input list of elements or array of elements or create empty buckets

**Step 2:** The size of the array is declared and each slot of the array is considered as a bucket that stores the elements.

**Step 3:** Then the elements are inserted into these buckets according to the range given or specified of the bucket.

**Step 4:** Once the elements are inserted into the buckets these elements are sorted using any stable sorting techniques.

**Step 5:** Continue the above 4th step until the elements are sorted. Then these elements are assembled by iterating through the bucket list and inserting each element into the list or array. This results in an ordered element list.

The above algorithm can be rewritten as follows:

```
Func_bucket_sort()
Start
First, n buckets each holding the range of values is created.
For loop (traverse all buckets)
Initialize 0 value to each new bucket.
For loop (traverse all buckets)
Elements are inserted into bucket with suitable matching range
For loop (traverse all buckets)
Elements in each bucket are sorted
Elements are concatenated or gathered from each element.
End Func_bucket_sort()
```

The bucket sort in Python or any programming language uses any sorting techniques for sorting the elements in the buckets such as quicksort, bubble sort, etc, and hence this bucket sort is mainly used for sorting data that are distributed over a certain range where bucket sort is also known as bin sort. Note that the number of buckets that are created is equal to the length of the array or list given

### How bucket sort in Python works with example?

In Python, the bucket sort is mainly used for data that are distributed or in the scattered format then using this sort buckets are created for each element for the given list or array and are also known as bin sort. Where the data are distributed first after creating buckets and then each element in the bucket are sorted using any of the sorting technique to sort in a particular order by sorting each element in a bucket and after sorting all the elements or data are concatenated and are added to the original list and this list is returned. Most of the time this sorting technique uses floating-point values as elements in the list or bucket list.

Let us see a simple example in the below section with Python code.

#### Example #1

**Code:**

```
print("Demonstration of bucket sort algorithm in Python ")
print("\n")
def func_insertion_sort(a):
for i in range(1, len(a)):
r = a[i]
j = i - 1
while j >= 0 and a[j] > r:
a[j + 1] = a[j]
j -= 1
a[j + 1] = r
return a
def func_bucket_sort(b):
arr = []
bucket_slot_num = 10
for i in range(bucket_slot_num):
arr.append([])
for j in b:
index_b = int(bucket_slot_num * j)
arr[index_b].append(j)
for i in range(bucket_slot_num):
arr[i] = func_insertion_sort(arr[i])
k = 0
for i in range(bucket_slot_num):
for j in range(len(arr[i])):
b[k] = arr[i][j]
k += 1
return b
arr1 = [0.675, 0.876, 0.345, 0.9875, 0.0123, 0.599]
print("The given array is as follows: ")
print(arr1)
print("\n")
print("Sorted Array is")
print(func_bucket_sort(arr1))
```

**Output:**

In the above example, we can see we have first declared and defined the logic for insertion sort algorithm in the function “func_insertion_sort()” where it is later used for sorting the elements in the buckets that are gathered. Then we are defining another function in which we are defining the logic for creating buckets and allotting each element for each slot as a bucket and inserting the elements into these slots which are considered as bucket after adding the elements each element in the buckets are sorted here it uses the function “func_insertion_sort()” which sorts the bucket using insertion sort and lastly all the sorted elements are concatenated. Therefore the array defined in the main will be sorted using the function “func_bucket_sort()” to sort the elements in the bucket which gathers all the sorted elements from the insertion sort function and results in sorted elements according to the range given (here it is 10). Hence it displays the sorted array in the above-given screenshot.

Now we will see another example that just uses the sort() function directly instead of any other sorting techniques within the bucket sort algorithm.

#### Example #2

**Code:**

```
print("Demonstration of bucket sort in Python")
print("\n")
arr1=[0.78,0.58,0.98,0.45,0.29,0.69]
a=[]
for i in range(len(arr1)):
a.append([])
r=len(arr1)
for i in range(0,r):
b=int(arr1[i]*r)
a[b].append(arr1[i])
for j in range(0,r):
a[j].sort()
index=0
for i in range(0,r):
for j in range(0,len(a[i])):
arr1[index]=a[i][j]
index+=1
print("The given array is as follows:" )
print(arr1)
print("\n")
print("Sorted data is:")
print(arr1)
```

**Output:**

In the above example, it is similar to the previous example where it used insertion sort for sorting the elements in the buckets, but in this example, we are using only the sort() function to sort the elements. Therefore the range is the size of the array given so it will use the sort function first for sorting elements then we are gathering and sort all the elements using the logic of bucket sort and the sorted array is displayed as shown in the above screenshot.

### Conclusion

In this article, we conclude that the bucket sort algorithm in Python is also a type of comparison algorithm to sort the given array. In this article, we can see that when using bucket sort there is another sorting technique used within this bucket sorts such as insertion sort, quick sort, etc we can use the direct sort() function also within the bucket sort. This completely depends on the developer to choose these sorting techniques or according to the speed and efficiency of the algorithms that can be used within the bucket sort algorithm.

### Recommended Articles

We hope that this EDUCBA information on “Bucket Sort Python” was beneficial to you. You can view EDUCBA’s recommended articles for more information.