代码填空:折半查找,假设待查表非递减有序。 public int half_search(int Arra...
问答题 代码填空:折半查找,假设待查表非递减有序。 public int half_search(int Array[],int x){ int n = -1; int low,high,mid; low = 0; high = ______; while(low < high){ mid =______; if(Array[mid] == x){ n = ______; break; }else{ if(______){ low = mid + 1; }else{ ______; } } } return n; }