Merge pull request #249 from priyanshi5/sort

Solved Bucket Sort

Author: smv1999

Sorting Algorithms/Bucket Sort.py

@@ -0,0 +1,39 @@
+def insertionSort(b):
+    for i in range(1, len(b)):
+        up = b[i]
+        j = i - 1
+        while j >= 0 and b[j] > up:
+            b[j + 1] = b[j]
+            j -= 1
+        b[j + 1] = up    
+    return b    
+             
+def bucketSort(x):
+    arr = []
+    slot_num = 10 # 10 means 10 slots, each
+                  # slot's size is 0.1
+    for i in range(slot_num):
+        arr.append([])
+         
+    # Put array elements in different buckets
+    for j in x:
+        index_b = int(slot_num * j)
+        arr[index_b].append(j)
+     
+    # Sort individual buckets
+    for i in range(slot_num):
+        arr[i] = insertionSort(arr[i])
+         
+    # concatenate the result
+    k = 0
+    for i in range(slot_num):
+        for j in range(len(arr[i])):
+            x[k] = arr[i][j]
+            k += 1
+    return x
+ 
+# Driver Code
+x = [0.897, 0.565, 0.656,
+     0.1234, 0.665, 0.3434]
+print("Sorted Array is")
+print(bucketSort(x))