【算法练习】数组的反转

	//反转数组，找到中间的位置。将首尾的数据交换，循环centerIndex次
	public static int[] reverse( int[] a){  
	    int centerIndex = a.length/2;  
	    int start = 0;  
	    int tail = a.length -1;  
	    int temp = 0;  
	    for (int i = 0; i < centerIndex ; i++) {  
	        temp = a[start];  
	        a[start] = a[tail];  
	        a[tail] = temp;  
	        start++;  
	        tail--;  
	    }  
	    return a;  
	}