求相邻元素的最大差值，先按从小到大排序最后比较

/**
     * 找出相邻元素的最大差值
     * @param a
     * @param n
     * @date 2016-10-7
     * @author shaobn
     */
    public static void findMaxDivision(int[] a,int n){
        int temp = 0;
        int count = n;
        int dir = Integer.MIN_VALUE;
        for(int i = 0;i<count-1;i++){
            if(a[i]>a[i+1]){
                temp = a[i];
                a[i]= a[i+1];
                a[i+1] = temp;        
            }
            if(i==count-2){
                count--;
                i=-1;
            }
        }
        for(int i=0;i<a.length-1;i++){
            if(a[i+1]-a[i]>dir){
                dir = a[i+1]-a[i];
            }
        }
        System.out.println(dir);
        
    }