From b0155e36a26a24451bc58ed3c7f60803755bbc87 Mon Sep 17 00:00:00 2001
From: Varun Upadhyay <varun.u28@gmail.com>
Date: Wed, 25 Oct 2017 06:33:01 -0700
Subject: [PATCH] Delete CountingSortIntegers.java

Removing as a generic version of counting sort already exists in Sorts
[Counting Sort](https://github.com/TheAlgorithms/Java/blob/master/Sorts/CountingSort.java)
---
 Sorts/CountingSortIntegers.java | 66 ---------------------------------
 1 file changed, 66 deletions(-)
 delete mode 100644 Sorts/CountingSortIntegers.java

diff --git a/Sorts/CountingSortIntegers.java b/Sorts/CountingSortIntegers.java
deleted file mode 100644
index 33b6e909..00000000
--- a/Sorts/CountingSortIntegers.java
+++ /dev/null
@@ -1,66 +0,0 @@
-/**
- *
- * @author Youssef Ali (https://github.com/youssefAli11997)
- *
- */
-
-class CountingSortIntegers {
-
-    /**
-     * This method implements the Counting Sort for integers
-     *
-     * @param array The array to be sorted 
-     * @param last The count of total number of elements in array
-     * Sorts the array in increasing order
-     * It sorts only integer arrays especially positive integers
-     * It uses array elements as indexes in the frequency array
-     * It can accept only array elements within the range [0:10^8]
-     **/
-
-    public static void CSI(int array[], int last) {
-    
-    	// The frequency array. It's initialized with zeros
-    	int[] frequency = new int[100000001];
-    	// The final output array
-    	int[] sortedArray = new int[array.length];
-    	int index = 0;
-    	
-    	// Counting the frequency of @param array elements
-    	for(int i=0; i<last; i++){
-    		frequency[array[i]]++;
-    	}
-    	
-    	// Filling the sortedArray
-    	for(int i=0; i<frequency.length; i++){
-    		for(int j=0; j<frequency[i]; j++)
-    			sortedArray[index++] = i;
-    	}
-    	
-    	for(int i=0; i<array.length; i++){
-    		array[i] = sortedArray[i];
-    	}
-    }
-
-    // Driver Program
-    public static void main(String[] args) {
-        // Integer Input
-        int[] arr1 = {4,23,6,78,1,54,231,9,12};
-        int last = arr1.length;
-        
-        System.out.println("Before Sorting:");
-        for (int i=0;i<arr1.length;i++) {
-            System.out.print(arr1[i] + " ");
-        }
-        System.out.println();
-
-        CSI(arr1, last);
-
-        // Output => 1 4 6 9 12 23 54 78 231
-        System.out.println("After Sorting:");
-        for (int i=0;i<arr1.length;i++) {
-            System.out.print(arr1[i] + " ");
-        }
-        System.out.println();
-
-    }
-}