摘要： int binarysearch(int arry[], int n, int goal) { int low = -1; int high = n; while(low + 1 > 1; if(arry[mid] = n || arry[high] != goal) ? -1 : high; } 阅读全文