选择最小的数放到第一个位置,在剩下的数中再找最小的数放到第二个位置,依此类推……
public class Selection {
public static void sort(Comparable[] a) {
// 将a[]按升序排列
int N = a.length;
for (int i = 0; i < N; i++) {
int min = i;
for (int j = i + 1; j < N; j++) {
if (less(a[j], a[min])) {
min = j;
}
}
exch(a, i, min);
}
}
private static boolean less(Comparable v, Comparable w) {
return v.compareTo(w) < 0;
}
private static void exch(Comparable[] a, int i, int j) {
Comparable t = a[i];
a[i] = a[j];
a[j] = t;
}
private static void show(Comparable[] a) {
for(int i=0;i<a.length;i++) {
System.out.print(a[i]+" ");
}
System.out.println();
}
public static void main(String[] args) {
Integer[] a = {1,3,7,7,0,5,7,1,0,5,9};
sort(a);
show(a);
}
}