Examples of Java data structures and algorithms: Selection Sort
- 2020-04-01 03:56:46
- OfStack
package al;
public class SelectSort {
public static void main(String[] args) {
SelectSort selectSort = new SelectSort();
int[] elements = { 14, 77, 21, 9, 10, 50, 43, 14 };
// sort the array
selectSort.sort(elements);
// print the sorted array
for (int i = 0; i < elements.length; i++) {
System.out.print(elements[i]);
System.out.print(" ");
}
}
public void sort(int[] array) {
// min to save the minimum element for each round
int min, tmp;
for(int i=0; i<array.length; i++) {
min = i;
// search for the minimum element
for(int j=i; j<array.length; j++) {
if(array[j] < array[min]) {
min = j;
}
}
// swap minimum element
tmp = array[i];
array[i] = array[min];
array[min] = tmp;
}
}
}