Selection Sort in Java
Below is an example of the Selection Sort algorithm in Java. See the Selection Sort page for more information and implementations.
selection-sort in Java
public class SelectionSort {
public static void main(String[] args)
{
int[] array = {12, 11, 15, 10, 9, 1, 2, 3, 13, 14, 4, 5, 6, 7, 8};
selectionSort(array);
System.out.println(java.util.Arrays.toString(array));
}
static void selectionSort(int[] array)
{
// step 1: loop from the beginning of the array to the second to last item
for (int currentIndex = 0; currentIndex < array.length - 1; currentIndex++)
{
// step 2: save a copy of the currentIndex
int minIndex = currentIndex;
// step 3: loop through all indexes that proceed the currentIndex
for (int i = currentIndex + 1; i < array.length; i++)
{
// step 4: if the value of the index of the current loop is less
// than the value of the item at minIndex, update minIndex
// with the new lowest value index */
if (array[i] < array[minIndex])
{
// update minIndex with the new lowest value index
minIndex = i;
}
}
// step 5: if minIndex has been updated, swap the values at minIndex and currentIndex
if (minIndex != currentIndex)
{
int temp = array[currentIndex];
array[currentIndex] = array[minIndex];
array[minIndex] = temp;
}
}
}
}