Java 冒泡排序算法实现详解

public class BubbleSort { public static void main(String[] args) { int[] arr = {5, 2, 8, 4, 9, 1}; bubbleSort(arr); for (int i : arr) { System.out.print(i + " "); } }

public static void bubbleSort(int[] arr) {
    for (int i = 0; i < arr.length - 1; i++) {
        for (int j = 0; j < arr.length - 1 - i; j++) {
            if (arr[j] > arr[j + 1]) {
                int temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
}

}

// 输出结果：1 2 4 5 8 9