二進制搜索方法的循環數

Question

嘿我想找到一個二進制搜索的比較數我已使這種方法來計算比較數。然而，它總是返回-1，因爲它沒有找到numsearch，儘管數組包含數字。 這是我的方法.. count指的是比較的數量。

public static int BinarySearch (int n, Integer[] ran) { 
    int low = 0; 
    int high = ran.length-1; 
     int count = 0; 
    int middle; 
    while (low<=high) { 

     count++; 
     middle = (high - low)/2; 
     if (ran[middle] == n) { 
      return count; 
     } 
     else if (ran[middle] > n) { 
      high = middle - 1; 

     } 
     else { 
      low = middle + 1; 

     } 

    } 


    return -1;   
    } 

Answer 1

更改最後一行從return -1到return count。

Answer 2

public static int BinarySearch(int n, Integer[] ran) { 
    int low = 0; 
    int high = ran.length - 1; 
    int count = 0; 
    while (high >= low) { 
     count++; 
     int middle = (low + high)/2; 
     if (ran[middle] == n) { 
      return count; 
     } 
     if (ran[middle] < n) { 
      low = middle + 1; 
     } 
     if (ran[middle] > n) { 
      high = middle - 1; 
     } 
    } 
    return count; 
}