Stooge sort impelementation using java

Author: [ravitej]

Sorting/StoogeSort/readme.md

@@ -0,0 +1,18 @@
+#STOOGE SORT
+
+>Input :   2 4 5 3 1
+
+>Output : 1 2 3 4 5
+
+>Explanation:
+
+Initially, swap 2 and 1 following above step 1.
+          1 4 5 3 2
+          Now, recursively sort initial 2/3rd of the elements.
+          1 4 5 3 2
+          1 3 4 5 2 
+          Then, recursively sort last 2/3rd of the elements.
+          1 3 4 5 2
+          1 2 3 4 5
+          Again, sort the initial 2/3rd of the elements to confirm final data is sorted.
+          1 2 3 4 5

Sorting/StoogeSort/stooge.java

@@ -0,0 +1,44 @@
+// Java program to implement stooge sort 
+import java.io.*; 
+
+public class stooge { 
+	static void stoogesort(int arr[], int l, int h) 
+	{ 
+		if (l >= h) 
+			return; 
+
+		// If first element is smaller than last, swap them 
+		if (arr[l] > arr[h]) { 
+			int t = arr[l]; 
+			arr[l] = arr[h]; 
+			arr[h] = t; 
+		} 
+
+		// If there are more than 2 elements in the array 
+		if (h - l + 1 > 2) { 
+			int t = (h - l + 1) / 3; 
+
+			// Recursively sort first 2/3 elements 
+			stoogesort(arr, l, h - t); 
+
+			// Recursively sort last 2/3 elements 
+			stoogesort(arr, l + t, h); 
+
+			// Recursively sort first 2/3 elements again to confirm 
+			stoogesort(arr, l, h - t); 
+		} 
+	} 
+
+	 
+	public static void main(String args[]) 
+	{ 
+		int arr[] = { 2, 4, 5, 3, 1 }; 
+		int n = arr.length; 
+
+		stoogesort(arr, 0, n - 1); 
+
+		for (int i = 0; i < n; i++) 
+			System.out.print(arr[i] + " "); 
+	} 
+} 
+