1 static int Search(int[] Array, int ArrLength, int Key)
2 {
3 int low = 0;
4 int high = ArrLength - 1;
5 int mid;
6
7 while (low <= high)
8 {
9 mid = (low + high) / 2;
10 if (Array[mid] < Key)
11 {
12 low = mid + 1;
13 }
14 else if (Array[mid] > Key)
15 {
16 high = mid - 1;
17 }
18 else
19 {
20 return mid;
21 }
22 }
23
24 return -1;
25 }
懒得泛型了，勿喷...
