自己整理的排序算法之（1） 选择排序

//选择排序
package sort;

public class SelectionSort {
    public static void SelectionSort(double[] list){
        for(int i=0;i<list.length-1 ;i++){
            double currentMin = list[i];
            int currentMinIndex = i;
            
            for(int k=i+1 ;k<list.length ; k++){
                if(currentMin>list[k]){
                    currentMin = list[k];
                    currentMinIndex = k;    
                }    
            }
            
            if(currentMinIndex != i){
                
                list[currentMinIndex] = list[i];
                list[i] =currentMin; 
            }
        }
    }
    
    public static void main(String[] args){
        double[] list ={5.2 , 1.4 , 6.3,  2.3  ,4.6};
        SelectionSort(list);
        for(int i =0;i<list.length;i++){
            System.out.print(list[i]+" ");
        }
    }
}