save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
-b=8
+b=21
 nlist = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 l=0
 h=len(nlist)-1
@@ -12,7 +12,7 @@ while l<=h:
         break
     elif g < b:
         l=m+1
-    elifg>b:
+    elif g >b:
         h=m-1