SelectionSort.java

// Java program for implementation of Selection Sort
publicclassSelectionSort
{
voidsort(intarr[])
 {
intn = arr.length;

// One by one move boundary of unsorted subarray
for (inti = 0; i < n-1; i++)
 {
// Find the minimum element in unsorted array
intmin_idx = i;
for (intj = i+1; j < n; j++)
if (arr[j] < arr[min_idx])
min_idx = j;

// Swap the found minimum element with the first
// element
inttemp = arr[min_idx];
arr[min_idx] = arr[i];
arr[i] = temp;
 }
 }

// Prints the array
voidprintArray(intarr[])
 {
intn = arr.length;
for (inti=0; i<n; ++i)
System.out.print(arr[i]+" ");
System.out.println();
 }

// Driver code to test above
publicstaticvoidmain(Stringargs[])
 {
SelectionSortob = newSelectionSort();
intarr[] = {64,25,12,22,11};
ob.sort(arr);
System.out.println("Sorted array");
ob.printArray(arr);
 }
}