Arrays类与冒泡排序

package com.alibaba.demo4;

import java.util.Arrays;
import java.util.Scanner;

public class pai_xu {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[] arr = {3,1,12,5,8,6,10};
        Arrays.sort(arr);
        for(int i = arr.length-1;i>=0;i--){
            System.out.println(arr[i]);
        }
    }
}

//冒泡排序:两两比较，大的往后排
    public static void maopao (int[] arr){
        for(int i=0;i<arr.length;i++){
            boolean boo = false;
            for(int j=0;j<arr.length-1-i;j++){
                if(arr[j]>arr[j+1]){
                    int temp = arr[j+1];
                    arr[j+1] = arr[j];
                    arr[j] = temp;
                    boo = true;
                }
            }
            if(boo = false){
                break;
            }
        }
        for(int a :arr){
            System.out.print(" "+a);
        }
        System.out.println();
    }