mirror of
https://github.com/hao14293/2021-Postgraduate-408.git
synced 2026-02-03 02:23:40 +08:00
Create 01-复杂度3 二分查找 (20 分).c
This commit is contained in:
21
ZJU_MOOC_数据结构/01-复杂度3 二分查找 (20 分).c
Normal file
21
ZJU_MOOC_数据结构/01-复杂度3 二分查找 (20 分).c
Normal file
@@ -0,0 +1,21 @@
|
||||
Position BinarySearch( List L, ElementType X ){
|
||||
int p = 0;
|
||||
int s = 1;
|
||||
int e = L->Last;
|
||||
int num = e/2;
|
||||
while(num--){
|
||||
int mid = (s + e) / 2;
|
||||
if(L->Data[mid] == X){
|
||||
p = mid;
|
||||
break;
|
||||
}else if(L->Data[mid] > X){
|
||||
e = mid - 1;
|
||||
}else if(L->Data[mid] < X){
|
||||
s = mid + 1;
|
||||
}
|
||||
|
||||
}
|
||||
if(p == 0)
|
||||
return NotFound;
|
||||
return p;
|
||||
}
|
||||
Reference in New Issue
Block a user