选择排序算法
1、java代码实现
package com.pers.lxb;
public class Selection {
public static Comparable[] sort(Comparable[] array){
int len=array.length;
for (int i = 0; i <len-1; i++) {
int max = 0;
for (int j = 0; j <len-1-i; j++) {
if(bigger(array[j+1],array[j])){
max=j+1;
}
}
exchange(array,max,len-i-1);
}
return array;
}
public static boolean bigger(Comparable a,Comparable b){
return a.compareTo(b)>0;
}
public static void exchange(Comparable[] arrays,int i,int j){
Comparable temp=arrays[i];
arrays[i]=arrays[j];
arrays[j]=temp;
}
}