冒泡排序（升）

package array;

import java.util.Arrays;

public class demo02 {
    public static void main(String[] args) {
        int[] a ={1,31,321,32,23,4,45};
        int[] sort = sort(a);
        System.out.println(Arrays.toString(sort));
    }


    public static int[] sort(int[] array){
        int temp =0;

        for (int i = 0; i <array.length-1; i++) {

            for (int j = 0; j <array.length-1; j++) {
                if(array[j+1]<array[j]){
                    temp = array[j];
                    array[j] = array[j+1];
                    array[j+1]= temp;
                }
            }
        }
        return array;
    }

}