Added 3 sorts in java div-bargali#154

Added 3 sorts in java div-bargali#154

Author: div-bargali

Java/Algorithms/Sorting/CountingSort.java

@@ -0,0 +1,28 @@
+static void countSort(int[] arr) 
+{ 
+int max = Arrays.stream(arr).max().getAsInt(); 
+int min = Arrays.stream(arr).min().getAsInt(); 
+int range = max - min + 1; 
+int count[] = new int[range]; 
+int output[] = new int[arr.length]; 
+for (int i = 0; i < arr.length; i++) 
+{ 
+count[arr[i] - min]++; 
+} 
+
+for (int i = 1; i < count.length; i++) 
+{ 
+count[i] += count[i - 1]; 
+} 
+
+for (int i = arr.length - 1; i >= 0; i--) 
+{ 
+output[count[arr[i] - min] - 1] = arr[i]; 
+count[arr[i] - min]--; 
+} 
+
+for (int i = 0; i < arr.length; i++) 
+{ 
+arr[i] = output[i]; 
+} 
+} 

Java/Algorithms/Sorting/PigeonHoleSort.java

@@ -0,0 +1,30 @@
+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]; 
+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; 
+
+} 

Java/Algorithms/Sorting/RecursiveBubbleSort.java

@@ -0,0 +1,24 @@
+public class Program {
+ public static void main(String[] args) {
+ int[] arr = bubbleSort(new int[] { 64, 34, 25, 12, 22, 11, 90 });
+ for (int i = 0; i < arr.length; System.out.println(arr[i++]))
+ ;
+
+ }
+
+ public static int[] bubbleSort(int[] arr) {
+ for (int i = 0; i < arr.length; i++) {
+ try {
+ int num = arr[i];
+ if (arr[i + 1] < num) {
+ arr[i] = arr[i + 1];
+ arr[i + 1] = num;
+ bubbleSort(arr);
+ }
+ } catch (IndexOutOfBoundsException e) {
+ continue;
+ }
+ }
+ return arr;
+ }
+}