递归实现逆转数组（Java实现）

public class ReverseArray {

public static void swap(int[] A, int a, int b){
int temp;
temp = A[a];
A[a] = A[b];
A[b] = temp;
}
public static void reverseArray(int A[], int start, int end){

if(start == end || start > end){
return;
}
if(start < end){
swap(A,start, end);
}
reverseArray(A, ++start, --end);

}

public static void main(String[] args){
int[] A = {1,2,3,4,5,6,7,8,9};
reverseArray(A, 0, A.length - 1);
printArray.printArrayint(A);
}

}