auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 b=8
-nlist = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+nlist = 
 l=0
 h=len (nlist)-1
 while l <= h:
     m=(l+h)//2
-    g=nlist[m]
+    g=alist[m]
     if g == b:
         print("找到了,索引值为",m)
         break