Selection Sort Algorithm in Java

Code:

package algorithm.sort;

public class SelectionSort {

public static void main(String[] args) {

int[] array = { 64, 25, 12, 22, 11 };
for (int i = 0; i < array.length - 1; i++) {

print(array);
// find smallest element, move it to its right place
int indexOfMinimumInArray = i;
for (int j = i + 1; j < array.length; j++) {
if (array[indexOfMinimumInArray] > array[j]) {
indexOfMinimumInArray = j;
}
}

if (indexOfMinimumInArray != i) {
// swap the smallest element to its right position
swap(i, indexOfMinimumInArray, array);
}
}
}

private static void swap(int i, int indexOfMinimumInArray, int[] array) {

int temp = array[i];
array[i] = array[indexOfMinimumInArray];
array[indexOfMinimumInArray] = temp;

}

static void print(int[] arr) {
for (int i = 0; i < arr.length; i++) {
System.out.print(" " + arr[i]);
}
System.out.println();

}

}

Comments

Post a Comment

Popular posts from this blog

Java Interview : Threads

Spring Framework Interview Notes : Part Two Wiring

Card Dealer In Java in Less than 5 minutes