python实现二分查找

python 实现顺序查找

def order_search(alist,e):
	"""
		在 alist中顺序查找e
	"""
	for idx,i in enumerate(alist):
		if i == e:
			target = idx
			break
		else:
			continue
	else: #for 循环正常结束
		return -1
	#for 循环非正常结束
	return target

Python实现二分查找(折半查找)

def binary_search(li, item):
    """二分查找：
		1.必须是有序的数组
		2.一次与中间值比较
	"""
    # first: 起始
    first = 0
    last = len(li) - 1

    while first <= last:
        # 一轮比较
        mid = (first + last) // 2
        if li[mid] < item:
            first = mid + 1
        elif li[mid] > item:
            last = mid - 1
        else:
            return True

    return False

if __name__ == '__main__':
    li = [1,2,3,4,5,6,7,8,9,10]
    if binary_search(li, 8):
        print('ok')
    else:
        print('no')