冒泡排序

尝试自己写一遍冒泡排序。

import java.util.Arrays;

public class arrayasDemo1 {
    public static void main(String[] args) {
        int[] z= {15,5464,456,4864,5645,456,456,48645123,86,87,453,46,6748545,5445};
        int[] sort=Sort(z);
        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;
    }
}

参考自up主：狂神说Java

冒泡排序

原文：https://www.cnblogs.com/zouzhang/p/12912769.html