From cf36eab3fd3330be3d12c6f82eb81fa4919d2100 Mon Sep 17 00:00:00 2001
From: nikhil kala <nikhilkala8@gmail.com>
Date: Fri, 15 Nov 2019 15:18:25 +0530
Subject: [PATCH] Revert "Created PigeonHole sorting algorithm"

---
 .../PigeonHole sorting algorithm.cpp          | 45 -------------------
 1 file changed, 45 deletions(-)
 delete mode 100644 Data Structure/PigeonHole sorting algorithm.cpp

diff --git a/Data Structure/PigeonHole sorting algorithm.cpp b/Data Structure/PigeonHole sorting algorithm.cpp
deleted file mode 100644
index 174f405b9..000000000
--- a/Data Structure/PigeonHole sorting algorithm.cpp	
+++ /dev/null
@@ -1,45 +0,0 @@
-#include <bits/stdc++.h> 
-using namespace std; 
-/* Sorts the array using pigeonhole algorithm */
-void pigeonholeSort(int arr[], int n) 
-{ 
-    // Find minimum and maximum values in arr[] 
-    int min = arr[0], max = arr[0]; 
-    for (int i = 1; i < n; i++) 
-    { 
-        if (arr[i] < min) 
-            min = arr[i]; 
-        if (arr[i] > max) 
-            max = arr[i]; 
-    } 
-    int range = max - min + 1; // Find range 
-    // Create an array of vectors. Size of array 
-    // range. Each vector represents a hole that 
-    // is going to contain matching elements. 
-    vector holes[range]; 
-    // Traverse through input array and put every 
-    // element in its respective hole 
-    for (int i = 0; i < n; i++) 
-        holes[arr[i]-min].push_back(arr[i]); 
-    // Traverse through all holes one by one. For 
-    // every hole, take its elements and put in 
-    // array. 
-    int index = 0;  // index in sorted array 
-    for (int i = 0; i < range; i++) 
-    { 
-       vector::iterator it; 
-       for (it = holes[i].begin(); it != holes[i].end(); ++it) 
-            arr[index++]  = *it; 
-    } 
-} 
-
-int main() 
-{ 
-    int arr[] = {9,2,3,8,1,6,9}; 
-    int n = sizeof(arr)/sizeof(arr[0]); 
-    pigeonholeSort(arr, n); 
-    printf("Sorted order is : "); 
-    for (int i = 0; i < n; i++) 
-        printf("%d ", arr[i]);
-    return 0; 
-}