bucket sort

Author: aish21

Practice Concepts/Sorting/bucket-sort.py

@@ -0,0 +1,30 @@
+# Python implementation of Bucket Sort Algorithm
+
+def bucketSort(array):
+    bucket = []
+
+    # Create empty buckets
+    for i in range(len(array)):
+        bucket.append([])
+
+    # Insert elements into their respective buckets
+    for j in array:
+        index_b = int(10 * j)
+        bucket[index_b].append(j)
+
+    # Sort the elements of each bucket
+    for i in range(len(array)):
+        bucket[i] = sorted(bucket[i])
+
+    # Get the sorted elements
+    k = 0
+    for i in range(len(array)):
+        for j in range(len(bucket[i])):
+            array[k] = bucket[i][j]
+            k += 1
+    return array
+
+
+array = [.42, .32, .33, .52, .37, .47, .51, .51]
+print("Sorted Array in descending order is")
+print(bucketSort(array))

README.md

@@ -530,7 +530,7 @@
 
 ![](https://github.com/aish21/Algorithms-and-Data-Structures/blob/main/Resources/Animations/counting-sort.gif)
 
-### [Radix Sort](/Practice%20Concepts/Sorting/counting-sort.py)
+### [Radix Sort](/Practice%20Concepts/Sorting/radix-sort.py)
 * Sorts the elements by first grouping the individual digits of the same place value. Then, sort the elements according to their increasing/decreasing order.
 * Method:
     - Find the largest element in the array
@@ -541,6 +541,22 @@
 
 ![](https://github.com/aish21/Algorithms-and-Data-Structures/blob/main/Resources/Animations/radix-sort.gif)
 
+### [Bucket Sort](/Practice%20Concepts/Sorting/bucket-sort.py)
+* Sorting algorithm that divides the unsorted array elements into several groups (buckets)
+* Each bucket is then sorted by using any of the suitable sorting algorithms or recursively applying the same bucket algorithm
+* Method:
+    - Create an array of size n. Each slot of this array is used as a bucket for storing elements.
+    - Insert elements into the buckets from the array. The elements are inserted according to the range of the bucket.
+    - The elements of each bucket are sorted using any of the stable sorting algorithms
+    - The elements from each bucket are gathered
+* Time Complexity: 
+    - Best: O(n + k)
+    - Average: O(n)
+    - Worst: O(n<sup>2</sup>) 
+* Space Complexity - O(n + k)
+
+![](https://github.com/aish21/Algorithms-and-Data-Structures/blob/main/Resources/Animations/bucket.webp)
+
 ## Search Algorithms
 <p align="center">
     <a href="#linear-search">Linear Search</a> •