Merge pull request #156 from iamsunil25/selection

Selection sort in java

Author: SarthakKeshari

Sorting/selection_Sort.java

@@ -0,0 +1,50 @@
+// Q. how to implement Selection Sort in java ?
+
+class SelectionSort
+{
+	void sort(int arr[])
+	{
+		int n = arr.length;
+
+		// One by one move boundary of unsorted subarray
+		for (int i = 0; i < n-1; i++)
+		{
+			// Find the minimum element in unsorted array
+			int min_idx = i;
+			for (int j = i+1; j < n; j++)
+				if (arr[j] < arr[min_idx])
+					min_idx = j;
+
+			// Swap the found minimum element with the first
+			// element
+			int temp = arr[min_idx];
+			arr[min_idx] = arr[i];
+			arr[i] = temp;
+		}
+	}
+
+	// Prints the array
+	void printArray(int arr[])
+	{
+		int n = arr.length;
+		for (int i=0; i<n; ++i)
+			System.out.print(arr[i]+" ");
+		System.out.println();
+	}
+
+	// Driver code to test above
+	public static void main(String args[])
+	{
+		SelectionSort ob = new SelectionSort();
+		int arr[] = {64,25,12,22,11,23,27,31,33,35,37};
+		
+      System.out.println("before Sorting array");
+      for(int el:arr){
+      System.out.print(el + " ");
+      }
+      System.out.println();
+      ob.sort(arr);
+		System.out.println("After Sorting array");
+		ob.printArray(arr);
+	}
+}