递归版冒泡排序

/**
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException {
int[] a = new int[] { 2, 4, 1, 9, 5, 3 };
sort(a, a.length);
System.out.println(Arrays.toString(a));
}

static void sort(int[] a, int length) {
if (length < 2)
return;
for (int i = 0; i < length - 1; i++) {
if (a[i] < a[i + 1]) {
a[i] ^= a[i + 1];
a[i + 1] ^= a[i];
a[i] ^= a[i + 1];
}
}
sort(a, length - 1);
}