# -*- coding:utf-8 -*-
def binSearch( A, e):
lo = 0
hi = len(A)
while lo < hi :
mi = int((lo + hi )/2)
if A[mi] > e :
hi = mi
elif A[mi] < e :
lo = mi + 1
elif A[mi] == e:
print(mi)
break
if A[mi] != e:
print("对不起!没有找到%d"%e)
if __name__=='__main__':
A = [1,2,3,4,5,6,7,8,9,10]
e = 3
binSearch(A, e)
def binSearch( A, e):
lo = 0
hi = len(A)
while lo < hi :
mi = int((lo + hi )/2)
if A[mi] > e :
hi = mi
elif A[mi] < e :
lo = mi + 1
elif A[mi] == e:
print(mi)
break
if A[mi] != e:
print("对不起!没有找到%d"%e)
if __name__=='__main__':
A = [1,2,3,4,5,6,7,8,9,10]
e = 3
binSearch(A, e)