Merge pull request deutranium#74 from adithyaakrishna/implement-pigeonhole-sort

Implemented Pigeon Hole Sort

Author: deutranium

sortingAlgo/pigeonholeSort/pigeonholeSort.cs

@@ -0,0 +1,50 @@
+using System; 
+  
+class GFG 
+{ 
+public static void pigeonhole_sort(int []arr, int n) 
+{ 
+    int min = arr[0]; 
+    int max = arr[0]; 
+    int range, i, j, index;  
+  
+    for(int a = 0; a < n; a++) 
+    { 
+        if(arr[a] > max) 
+            max = arr[a]; 
+        if(arr[a] < min) 
+            min = arr[a]; 
+    } 
+  
+    range = max - min + 1; 
+    int[] phole = new int[range]; 
+      
+    for(i = 0; i < n; i++) 
+    phole[i] = 0; 
+  
+    for(i = 0; i < n; i++) 
+        phole[arr[i] - min]++; 
+  
+      
+    index = 0; 
+  
+    for(j = 0; j < range; j++) 
+        while(phole[j] --> 0) 
+            arr[index++] = j + min; 
+  
+} 
+  
+// Driver Code 
+static void Main() 
+{ 
+    int[] arr = {8, 3, 2, 7,  
+                 4, 6, 8}; 
+  
+    Console.Write("Sorted order is : "); 
+  
+    pigeonhole_sort(arr,arr.Length); 
+      
+    for(int i = 0 ; i < arr.Length ; i++) 
+        Console.Write(arr[i] + " "); 
+} 
+} 

sortingAlgo/pigeonholeSort/pigeonholeSort.java

@@ -0,0 +1,49 @@
+import java.lang.*; 
+import java.util.*; 
+  
+public class MySort 
+{ 
+    public static void pigeonholeSort(int arr[], int n) 
+    { 
+        int min = arr[0]; 
+        int max = arr[0]; 
+        int range, i, j, index;  
+  
+        for(int a=0; a<n; a++) 
+        { 
+            if(arr[a] > max) 
+                max = arr[a]; 
+            if(arr[a] < min) 
+                min = arr[a]; 
+        } 
+  
+        range = max - min + 1; 
+        int[] phole = new int[range]; 
+        Arrays.fill(phole, 0); 
+  
+        for(i = 0; i<n; i++) 
+            phole[arr[i] - min]++; 
+  
+          
+        index = 0; 
+  
+        for(j = 0; j<range; j++) 
+            while(phole[j]-->0) 
+                arr[index++]=j+min; 
+  
+    } 
+  
+    public static void main(String[] args) 
+    { 
+        MySort sort = new MySort(); 
+        int[] arr = {8, 3, 2, 7, 4, 6, 8}; 
+  
+        System.out.print("Sorted order is : "); 
+  
+        sort.pigeonholeSort(arr,arr.length); 
+          
+        for(int i=0 ; i<arr.length ; i++) 
+            System.out.print(arr[i] + " "); 
+    } 
+  
+} 

sortingAlgo/pigeonholeSort/pigeonholeSort.py

@@ -0,0 +1,36 @@
+def pigeonholeSort(a): 
+
+    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, "Input Only Integers"
+        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: 
+            holes[count] -= 1
+            a[i] = count + my_min 
+            i += 1
+#Get The Size of The Array             
+print("Enter the Size of the Array :") 
+n=int(input())
+a=[]
+#Get The Elements of The Array
+for i in range(0,n):
+    ele=int(input())
+    a.append(ele)
+
+print("Pigeon Hole Sorted order is : ", end = ' ') 
+  
+pigeonholeSort(a) 
+          
+for i in range(0, len(a)): 
+    print(a[i], end = ' ')