原题地址
https://pintia.cn/problem-sets/1268384564738605056/problems/1268385944106778626
解题思路
主要是看懂题目啊…
参考代码
Position
BinarySearch(List L
, ElementType X
) {
int left
= 1, right
= L
-> Last
;
while (left
<= right
) {
int mid
= (left
+ right
) / 2;
int now
= L
-> Data
[mid
];
if (now
== X
) return mid
;
else if (now
< X
) left
= mid
+ 1;
else right
= mid
- 1;
}
return NotFound
;
}
