冒泡排序

package com.hai.week2;

public class Demo06 {
    public static void main(String[] args) {
        int a[] = {1,2,3,5,135,4,54,};
        int b[] = Arrayssort(a);
        for (int c:b
             ) {
            System.out.println(c);
        }
    }//方法实现
    public static int [] Arrayssort(int a[]){
        int temp=0;
        for (int i = 0; i < a.length-1; i++) {
            for(int j=0 ; j<a.length-1-i ;j++){
                if(a[j+1]>a[j]){
                    temp = a[j+1];
                    a[j+1] = a[j];
                    a[j] = temp;
                }
            }
        }

        return a;
    }
}