python实现二分法查找

一 代码

1. defBinarySearch(l,key):
2. low =0
3. high = len(l)-1
4. i =0
5. while(low <= high):
6. i = i+1
7. mid =(high + low)//2
8. if(l[mid]< key):
9. low = mid +1
10. elif(l[mid]> key):
11. high = mid -1
12. else:
13. print('use %d times is'% i)
14. return mid
15. return-1
17. if __name__ =='__main__':
18. l =[1,5,6,9,10,51,64,65,87]
19. print(BinarySearch(l,5))
20. print(BinarySearch(l,10))
21. print(BinarySearch(l,65))
22. print(BinarySearch(l,70))

二 运行结果

use 2 times is

1

use 1 times is

4

use 3 times is

7

-1