排序记录

/**
 * @des 冒泡排序
 * @param arrs
 */
public static int[] arrSort(int [] arrs){
    if (arrs.length==0){
        return arrs;
    }
    for(int i=0;i<arrs.length;i++){
        for(int j=0;j<arrs.length-1;j++){
            if(arrs[j]<arrs[j+1]){//大于升序 小于降序
                int temp = arrs[j];
                arrs[j] = arrs[j+1];
                arrs[j+1] = temp;
            }
        }
    }
    return arrs;
}
/**
 * @des  递归的二分查找
 * @param arrs
 * @param key
 * @param low
 * @param high
 * @return
 */
 
public static int recursionBinarySearch(int[] arrs,int key,int low,int high){
        if (arrs.length==0){
            return 0;
        }
        if(key<arrs[low] || key>arrs[high] || low>high){
            return -1;
        }
        int middle = (low+high)/2;
        if(arrs[middle]>key){
           return recursionBinarySearch(arrs, key, low, middle-1);
        }else if(arrs[middle]<key){
            return recursionBinarySearch(arrs, key, middle+1, high);
        }else{
            return middle;
        }
}