java - 基础 - 排序

    //冒泡排序,type = 0 则从小到大， type = 1则从大到小
    //遍历一遍如果后面的比前面的小（大），则两者交换，遍历length-1遍
    public void bubbleSort(int a[],int type){
        for(int i = 0; i < a.length - 1; i++) {
            for (int j = 0; j < a.length - 1; j++) {
                if ( (a[j] > a[j + 1] && type==0) || (a[j] < a[j + 1] && type == 1) ){
                    int n = a[j];
                    a[j] = a[j + 1];
                    a[j + 1] = n;
                }
                //showArray(a);
            }
        }
    }

    //选择排序,type = 0 则从小到大， type = 1则从大到小
    //遍历一遍选出前i个中最小（大）的和a[i-1]交换。i从length到1；
    public void selectionSort(int a[],int type){
        for(int i = a.length-1; i >= 0; i--) {
            int flag = 0;
            for (int j = 0; j <= i; j++) {
                if ( (a[flag] > a[j] && type==0) || (a[flag] < a[j] && type == 1) ){
                    flag = j;
                }
                //showArray(a);
            }
            int n = a[i];
            a[i] = a[flag];
            a[flag] = n;
        }
    }