public static void main(String[] args) {
int []n = {3,2,1,89,12,34,90,56,22,43,100,78};
int min ;
for (int out = 0; out <n.length; out++) {
min = n[out];
for (int in = out+1; in < n.length; in++) {
if(min>n[in]){
n[out]=n[in];
n[in]=min;
min=n[out];
}
}
}
System.out.println("排序后:");
for (int i : n ) {
System.out.print(i+",");
}
}
选择排序改进了冒泡排序,将必要的交换次数O(
N
²)降到了O(N),不过比较的次数仍保持为O(
N
²)
10-14
10-14