Update bucket_sort.py (TheAlgorithms#821)

* Some simplification

Author: Andy Lau

sorts/bucket_sort.py

@@ -13,45 +13,35 @@
 # Time Complexity of Solution:
 # Best Case O(n); Average Case O(n); Worst Case O(n)
 
-from __future__ importprint_function
-frominsertion_sortimportinsertion_sort
-importmath
-
-DEFAULT_BUCKET_SIZE=5
-
-defbucketSort(myList, bucketSize=DEFAULT_BUCKET_SIZE):
-if(len(myList) ==0):
-print('You don\'t have any elements in array!')
-
-minValue=myList[0]
-maxValue=myList[0]
-
-# For finding minimum and maximum values
-foriinrange(0, len(myList)):
-ifmyList[i] <minValue:
-minValue=myList[i]
-elifmyList[i] >maxValue:
-maxValue=myList[i]
-
-# Initialize buckets
-bucketCount=math.floor((maxValue-minValue) /bucketSize) +1
-buckets= []
-foriinrange(0, bucketCount):
+DEFAULT_BUCKET_SIZE=5
+defbucket_sort(my_list,bucket_size=DEFAULT_BUCKET_SIZE):
+if(my_list==0):
+print("you don't have any elements in array!")
+
+
+min_value=min(my_list)
+max_value=max(my_list)
+
+bucket_count=(max_value-min_value)//bucket_size+1
+buckets=[]
+foriinrange(bucket_count):
 buckets.append([])
+foriinrange(len(my_list)):
+buckets[(my_list[i]-min_value)//bucket_size].append(my_list[i])
+
+
+sorted_array=[]
+foriinrange(len(buckets)):
+buckets[i].sort()
+forjinrange(len(buckets[i])):
+sorted_array.append(buckets[i][j])
+returnsorted_array
 
-# For putting values in buckets
-foriinrange(0, len(myList)):
-buckets[math.floor((myList[i] -minValue) /bucketSize)].append(myList[i])
 
-# Sort buckets and place back into input array
-sortedArray= []
-foriinrange(0, len(buckets)):
-insertion_sort(buckets[i])
-forjinrange(0, len(buckets[i])):
-sortedArray.append(buckets[i][j])
 
-returnsortedArray
 
-if__name__=='__main__':
-sortedArray=bucketSort([12, 23, 4, 5, 3, 2, 12, 81, 56, 95])
-print(sortedArray)
+#test
+#besd on python 3.7.3
+user_input=input('Enter numbers separated by a comma:').strip()
+unsorted=[int(item) foriteminuser_input.split(',')]
+print(bucket_sort(unsorted))