The document describes a Java program that implements selection sort on an integer array. It contains a main method that initializes an integer array, prints the array before and after sorting, and calls the selection sort method. The selection sort method loops through the array, finds the smallest element in each pass, and swaps it into the current slot.
Download as DOCX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
75 views
Java Program To Implement Selection Sort
The document describes a Java program that implements selection sort on an integer array. It contains a main method that initializes an integer array, prints the array before and after sorting, and calls the selection sort method. The selection sort method loops through the array, finds the smallest element in each pass, and swaps it into the current slot.
{ for (int i = 0; i < array.length - 1; i++) { System.out.println("Sort Pass Number "+(i+1)); int index = i; for (int j = i + 1; j < array.length; j++) { System.out.println("Comparing "+ array[index] + " and " + array[j]); if (array[j] < array[index]){ System.out.println(array[index] + " is greater than " + array[j] ); index = j;
} }
int smallerNumber = array[index];
array[index] = array[i]; array[i] = smallerNumber; System.out.println("Swapping Elements: New Array After Swap"); printArray(array); } } static void printArray(int[] array){