Java实现冒泡排序算法：简单易懂的代码示例

public class BubbleSort {

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

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

}