二分法查找適合于有序集合或數組
static int HalfSearch(int[] numArr,int num){ //確定查找的范圍 int low = 0; int high = numArr.Length-1; int mid = 0; while (low <= high) { mid = (low + high) / 2; if (numArr[mid] == num) { return mid; } else if (numArr[mid] > num) { high = mid - 1; } else { low = mid + 1; } } return -1;}新聞熱點
疑難解答
