简单粗暴的冒泡排序

public static void main(String[] args) {
    int[] array = {4,5265,347,8,9,76,2456,154356};
    //外循环控制比较次数，数组有8个元素，比较7次
    //内循环控制每一轮的内部比较，-1防止索引越界，-i比较一轮少一轮
    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 temp = array[j];
                array[j]=array[j+1];
                array[j+1]=temp;
            }
        }
    }
    System.out.println(Arrays.toString(array));
}

结果：[4, 8, 9, 76, 347, 2456, 5265, 154356]