save project

binary_search.py

-# 使用二分查找法，找出9和20在列表里面的索引
-w=20
-q = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-e=0
-r=len(q)-1
-while e<=r:
-    y=(e+r)//2
-    u=q[y]
-    if u==w:
-        print(y)
-        break
-    elif u<w:
-        e=y+1
-    elif u<w:
-        r=y-1
\ No newline at end of file