数据结构之选择排序

冒泡完就选择一下吧,让我们再看看选择排序的代码又是如何实现的.

public class Selection{
    public static void sort(Comparable[] a){
        for(int i = 0; i < a.length-1; i++){
            int minIndex = i;
            for(int j = i+1; j < a.length; j++){
                if(greater(a[minIndex], a[j])){
                    minIndex = j;
                }
            }
            exch(a, i, minIndex);
        }
    }
    private static boolean greater(Comparable v, Comparable w){
        return v.compareTo(w) > 0;
    }
    
    private static void exch(Comparable[] a, int i, int j){
        Comparable temp;
        temp = a[i];
        a[i] = a[j];
        a[j] = temp;
    }
}