1、代碼如下:
package org.gzw.ch02;
public class SelectionSort {
public static void sort(long[] arr){
int k = 0; //最小值的索引
long tmp = 0;
for(int i=0;i<arr.length-1;i++){
k = i;
for(int j=i+1;j<arr.length;j++){
//交換
if(arr[j] < arr[k]){
k = j;
}
}
tmp = arr[k];
arr[k] = arr[i];
arr[i] = tmp;
}
}
public static void main(String[] args) {
long[] l = new long[]{12,33,2,-2,4,901,99,5,64};
System.out.print("初始的數組:[");
for(int i=0;i<l.length;i++){
System.out.print(l[i] + ", ");
}
System.out.println("]");
sort(l); //選擇排序
System.out.print("選擇排序後的數組:[");
for(int i=0;i<l.length;i++){
System.out.print(l[i] + ", ");
}
System.out.println("]");
}
}
2、運行結果:
初始的數組:[12, 33, 2, -2, 4, 901, 99, 5, 64, ]
選擇排序後的數組:[-2, 2, 4, 5, 12, 33, 64, 99, 901, ]