BubbleSortSwapCountRecursion.java

public static void sort(Integer[] a, int len) {
    if (len <= 1) {
        return;
    }

    boolean swapped = false;
    for (int i=1; i<len; i++) {
        if (a[i-1] > a[i]) {
            swap(a, i, i-1);
            swapped = true;
        }
    }

    if (swapped) {
        sort(a, len-1);
    }
}