查找

1、二分查找

def BinarySearch(list,left,right,key):  
    if left==right:
        if list[left]==key:
            return left
        else:
            return -1
    else:
        middle=math.ceil((left+right)/2)
        if list[middle]>key:
           find= BinarySearch(list,left,middle-1,key)
        else:
           find= BinarySearch(list,middle,right,key)
    return find

2、Hash查找

def InsertHash(hashlist,hashlen,data):
    hashAddress=data%hashlen
    while hashlist[hashAddress]!=0:
        hashAddress+=1
        hashAddress=hashAddress%hashlen
    hashlist[hashAddress]=data

def HashSearch(hashlist,hashlen,key):
    hashAddress=key%hashlen
    while hashlist[hashAddress]!=0 and hashlist[hashAddress]!=key:
        hashAddress+=1
        hashAddress=hashAddress%hashlen
    if hashlist[hashAddress]==0:
        return -1
    return hashAddress