冒泡排序

public class BubbleSort {
    public static void bubbleSort(Comparable[] arr) {
        for (int path = 1; path < arr.length; path++) {
            boolean flag = true;
            for (int i = 0; i < arr.length - path; i++) {
                if (arr[i].compareTo(arr[i + 1]) > 0) {
                    swap(arr, i, i + 1);
                    flag = false;
                }
            }

            if (flag) {
                break;
            }
        }
    }

    private static void swap(Comparable[] arr, int i, int j) {
        Comparable tmp = arr[i];
        arr[i] = arr[j];
        arr[j] = tmp;
    }
}