# -*-coding=utf-8 -*-
#filename: list_query
#date: 2018-03-25
#author: guosw
import time
def cost_time(fun):
def cost(*args,**kwargs):
stime = time.time()
x = fun(*args,**kwargs)
etime = time.time()
print "function name:",fun.__name__
print "time cost:",etime-stime
return x
return cost
@cost_time
def list_query(_list,_val):
low = 0
height = len(i) - 1
mid = (height - low) // 2
for n in xrange(height+1):
if _list[n] == _val:
return n
for n in xrange(mid,height+1):
if _list[n] == _val:
return n
if __name__ == "__main__":
i = xrange(100000)
subscript = list_query(i,9999)
print subscript
本文介绍了一个使用Python实现的列表查询函数,并通过装饰器的方式记录了查询所需的时间成本。该函数适用于已排序的列表,通过逐步缩小查找范围来提高查找效率。
1756

被折叠的 条评论
为什么被折叠?



