冒泡排序

    public int[] sortMaopao(int[] arry){
        for (int i = 0; i <arry.length ; i++) {
            for (int j = 0; j < arry.length-1-i; j++) {
                if (arry[j]>arry[j+1]) {//从小到大排列
                     //交换两数的位置
                    int temp = arry[j];
                    arry[j] = arry[j + 1];
                    arry[j + 1] = temp;
                }
            }
        }
        return arry;
    }