Create 01-复杂度3 二分查找 (20 分).c

gaochuang98 · May 1, 2019 · 44382c7 · 44382c7
1 parent 8883d67
commit 44382c7
Showing 1 changed file with 21 additions and 0 deletions.
diff --git a/ZJU_MOOC_数据结构/01-复杂度3 二分查找 (20 分).c b/ZJU_MOOC_数据结构/01-复杂度3 二分查找 (20 分).c
@@ -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;
+}