数组排序

public class selectSort {
    public static void selectionSort(int[]b) {
        for (int i = 0;i< b.length;i++) {
            int k = i;//用来保存元素排序时的最小下标
            for (int j = i+1;j< b.length;j++) {
                if (b[k]>b[j]) k=j;//记录数组中最小的那一位的下标
            }
            if (k!=i){//将数组的最小一位放在最前面
                int temp = b[i];
                b[i] = b[k];
                b[k] = temp;
            }
        }
    }
    public static void main(String[] args) {
        int []a = {1,7,3,9,2,5,8,4};//静态初始化
        System.out.println("排序之前的数为：");
        for (int i = 0;i<a.length;i++){
            System.out.print(a[i]+" ");//输出数组
        }
        selectionSort(a);//执行函数selectionSort
        System.out.println("\n排序后数组的顺序为：");
        for (int i = 0;i<a.length;i++){
            System.out.print(a[i]+" ");
        }
    }
}

public class selectSort2 {
    public static void main(String[] args) {
        int score[] = {24,35,12,10,300};
        System.out.println("排序之前的数值是：");
        for (int i = 0;i<score.length;i++)
            System.out.print(score[i]+" ");
        for(int i = 0;i<score.length-1;i++){
            for (int j = i+1;j< score.length;j++){
                if(score[i]<score[j]){
                    int temp = score[j];
                    score[j] = score[i];
                    score[i] = temp;
                }
            }
        }
        System.out.println("\n排序后的数值为：");
        for (int i = 0;i<score.length;i++){
            System.out.print(score[i]+" ");
        }
    }
}