对一个有序数组 进行逆序操作

觉得还是首尾位置的值调换比较简单直接吧  

    private void reverse(int[] x,int low,int high){
        int nums = (high-low) >> 1;
        for(int i=0;i<nums;i++){
            int tem = x[i];
            x[i] = x[high-i];
            x[high-i] = tem;
        }
    }    private void re