冒泡排序法

import java.util.Scanner;
class Bubble{
    public static void main(String[] args){

        int [] a=new int[5];
        System.out.println("请输入"+a.length+"个数：");
        for(int i=0;i<a.length;i++){
        Scanner sc=new Scanner(System.in);
        a[i]=(int)sc.nextInt();
        }
        Util u=new Util();
        u.bubblesort(a);
        u.printArray(a);

    }
}
class Util{
    public void printArray(int [] arr){
        System.out.print("{");
        for(int i=0;i<arr.length;i++){
        if(i==arr.length-1){
        System.out.print(arr[i]+"}");
        }else{
        System.out.print(arr[i]+",");
        }

        }
    }
    public void bubblesort(int [] array){
        for(int i=0;i<array.length-1;i++){
            for(int j=0;j<array.length-1-i;j++){
                if(array[j]>array[j+1]){
                    int tmp=array[j];
                    array[j]=array[j+1];
                    array[j+1]=tmp;
                }

            }

        }
    }