摘要：
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]) { ... 阅读全文
posted @ 2012-05-08 22:41
世界万物
阅读(96)
评论(0)
推荐(0)
浙公网安备 33010602011771号