冒泡排序图解+代码示例

public class Demo1 {

    public static void main(String[] args) {
        int[] nums = {20,8,10,36,56,48,12};
        for (int num : nums) {
            System.out.print(num+" ");
        }
        bubbleSort(nums);
        System.out.println();
        for (int num : nums) {
            System.out.print(num+" ");
        }
    }
    //冒泡排序 :n个数字来排列，两两比较，小靠前，外层循环n-1，内层循环n-1-i
    public static void bubbleSort(int[] arr){
        for (int i = 0; i < arr.length-1; i++) {
            for (int j = 0; j < arr.length-i-1; j++) {
                if(arr[j]>arr[j+1]){
                    int t = arr[j];
                    arr[j]=arr[j+1];
                    arr[j+1]=t;
                }
            }
        }
    }
}