小编Jer*_*cis的帖子

我想从用户获取用户输入并进行非递归二进制搜索可以任何人告诉我如何做它会不胜感激

public class Main {
// binarySeach: non-recursive
   public int Main(int[] a, int x) {
      int low = 0;
  int high = a.length - 1;
  while (low <= high) {
     int mid = (low + high)/2;
     if (a[mid] == x) return mid;
     else if (a[mid] < x) low = mid + 1;
     else high = mid - 1;
  }
  return -1;
  }



 public static void main(String[] args) {
      Main bin = new Main();
  int[] a =
    { 2, 8,12,14,16,19,24,28,31,33,// 0-9 …