标签：
# -*- coding: UTF-8 -*- def search(a,m): low = 0 i = 0 top = len(a) while(low<=top): mid = (low+top)/2 mids = a[mid] if m<mids:top=mid-1;i+=1;print mids,i elif m>mids:low=mid+1;i+=1;print mids,i else :i+=1;return mids,i
很简单没啥解释的吧我觉得，我把每次查找的结果都写了出来。
标签：
原文地址：http://www.cnblogs.com/webgavin/p/5256358.html
