冒泡排序

package cn.itcast.demo2;
import java.util.Arrays;
public class MaoPao {
public static void main(String[] args) {
    int arry[]={1,2,5,3};
    function(arry);
}
public static void function(int[] arry){
    
    //int t=0;
    for(int i=0;i<arry.length;i++){
        for(int j=0;j<arry.length-i-1;j++){
            if(arry[j]>arry[j+1]){
                int t=arry[j];
                arry[j]=arry[j+1];
                arry[j+1]=t;
            }
         }    
    }
    System.out.println(Arrays.toString(arry));
}
}