摘要：static int BinarySearch(int[] arr, int dest) { int rs = -1; int low = 0; int hight = arr.Length - 1; while (low <= hight) { int mid = (low + hight) / 2; if (dest == arr[mid]) { ... 阅读全文