冒泡排序实现

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

def bubble_sort(arr):
    if arr == None or len(arr) < 2:
        return
    for iter_length in range(len(arr) - 1, 0, -1):
        for i in range(0, iter_length):
            if (arr[i] > arr[i + 1]):
                arr[i], arr[i+1] = arr[i+1], arr[i]