题解 | #二分查找-I#

//二分 public static void search(int[]arr,int target){ int l=0; int r=arr.length-1;  sort(arr,l,r); while (l//开始查找数据  int mid=(l+r)/2; if (arr[mid]==target){ for (int i : arr) {
                System.out.print(i+" ");  }
            System.out.println();  System.out.println("找到target: "+arr[mid]);  System.out.println("索引:"+mid);  break;  }else if (arr[mid]>target){
            r=mid-1;  }else if (arr[mid]<target){
            l=mid+1;  }
    }
}