数组基础--二分查找

freedomUSTB

于 2020-07-18 09:29:35 发布

阅读量88

点赞数

原文链接：https://www.cnblogs.com/yupeng/p/3418293.html

版权

二分查找

参考解析

#!/usr/bin/python
# -*- coding: utf-8 -*-

def BinarySearch(array,t):
    low = 0
    height = len(array)-1
    while low < height:
        mid = (low+height)/2
        if array[mid] < t:
            low = mid + 1

        elif array[mid] > t:
            height = mid - 1

        else:
            return array[mid]

    return -1

if __name__ == "__main__":
    print BinarySearch([1,2,3,34,56,57,78,87],57)