Updated in pep8

pooja795 · web-flow · commit ef8803faa8e1 · 2019-10-24T14:23:32.000+05:30
diff --git a/algorithms/sorting/pigeonhole_sort.py b/algorithms/sorting/pigeonhole_sort.py
@@ -1,22 +1,26 @@
-Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number of elements and the number of possible key values are approximately the same.
-It requires O(n + Range) time where n is number of elements in input array and ‘Range’ is number of possible values in array.
+#Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number of elements and the number of possible key values are approximately the same.
+#It requires O(n + Range) time where n is number of elements in input array and ‘Range’ is number of possible values in array.
 
 def pigeonhole_sort(a): 
-    # size of range of values in the list  
-    # (ie, number of pigeonholes we need) 
     my_min = min(a) 
     my_max = max(a) 
     size = my_max - my_min + 1
   
     # our list of pigeonholes 
+    
+    
     holes = [0] * size 
   
     # Populate the pigeonholes. 
+    
+    
     for x in a: 
         assert type(x) is int, "integers only please"
         holes[x - my_min] += 1
   
     # Put the elements back into the array in order. 
+    
+    
     i = 0
     for count in range(size): 
         while holes[count] > 0: 
@@ -27,8 +31,6 @@ def pigeonhole_sort(a):
   
 a = [8, 3, 2, 7, 4, 6, 8] 
 print("Sorted order is : ", end = ' ') 
-  
 pigeonhole_sort(a) 
-          
 for i in range(0, len(a)): 
     print(a[i], end = ' ') 
