妙趣横生的python 算法 之 折半查找

之前的代码写的比较匆忙，真实不好意思啊，见笑了，
代码已经更正

# -*- coding:utf8 -*-
import os
import sys
import math

def halfSearch(arr=[1,2,3,4,5],find = 1):
    '''
    折半查找，2分查找
    折半查找的前提是数据是有序的
    算法：mid = Math.floor(low+hight/2)
    '''
    mid = 0
    low = 0 
    high = len(arr) - 1
    while(low<=high):
        print low,high
        mid = (low + high)/2
        print mid
        if(arr[mid]==find):
            print "find %s index is %s",(find,mid)
            return
        else:
            if(find > arr[mid]):
                low = mid + 1
            else:
                high = mid - 1
    print "Not Find"
    return None

#运行脚本
if __name__ =="__main__":
    halfSearch()