[数据结构与算法]Java 冒泡排序法

执行图:

package com.atguigu.demo;

import java.util.Arrays;

public class 冒泡排序法 {
    public static void main(String[] args) {
        //定义静态数组
        int[] arr = {87,81,92,74,2,32,48,63,45,82,46,94};
        //使用循环遍历将数两两做比较s
        System.out.println("Arrays.toString(arr) = " + Arrays.toString(arr));
        for (int j = 0; j < arr.length-1; j++) {
            System.out.println("j = " + j); //输出
            for (int i = 0; i < arr.length-1-j; i++) {
                System.out.print("i = " + i+"\t"); //输出
                //判断第一个数是否大于第二个数
                if (arr[i] < arr[i+1]){
                    //定义变量temp放大的数,
                    int temp =arr[i];
                    arr[i] = arr[i+1];
                    arr[i+1] = temp;
                }
            }
            System.out.println();
        }
        System.out.println("Arrays.toString(arr) = " + Arrays.toString(arr));
    }
}