python二分查找，python二分,python二分查找[P

python二分查找，python二分,python二分查找[P

python二分查找

[Python]代码

#-*- coding: utf-8 -*-# 伪码请见Discrete Mathmatics and Its Application. Kenneth Rosen. pp172.# 2012-08-01import mathdef binarySearch(x, a):   i = 0   j = len(a)-1   while i < j:     m = int(math.floor( (i + j)/2))     if x > a[m]:        i = m + 1     else: j = m   if x == a[i]:    location = i   else: location = 0   return location# python 风格的定位方法：def location(x, a):  if x in a:     return a.index(x)  else: return 0a = [1, 2, 3, 4, 5, 6]x = 5print binarySearch(x, a)print location(x, a)