/**?* 二分法查找?* 二分法查找建立在已經排序好的基礎上 ??*/public class BinaryChopTest { public static void main(String[] args) { int []arry = {1,3,4,5,8,10,15,25,29}; Scanner in = new Scanner(System.in); System.out.println("請輸入您要查找的元素："); int num = in.nextInt(); System.out.println(binarySearch(arry,num)); } public static String binarySearch(int [] a,int num){ int begin = 0; int end = a.length-1; while(begin<=end){ int mid = (begin+end)/2; if(a[mid]==num){ return "您輸入的數的下標是："+mid; } if(a[mid]>num){ end = mid-1; } if(a[mid]<num){ begin = mid+1; } } return "您輸入的數不在當前數組中"; }}最后那兩個if啥意思不太懂
這個二分查找法有一點不懂
慕先生4463397
2017-10-12 16:25:09
