归并排序和二分法查找

#归并排序

#二分法查找

```python
def binarySearch(alist,item):
    #递归
    n=len(alist)
    if n>0:
        mid=n/2
        if alist(mid)==item:
            return True
        elif item<alist[mid]:
            return binarySearch(alist[:mid],item)
        else:
            return binarySearch(alist[mid+1:],item)
    return False

def binary_search(alist,item):
    #非递归
    n=len(alist)
    first=0
    last=n-1
    while first <= last:
        mid=(first+last)//2
        if alist[mid]==item:
            return True
        elif item<alist[mid]:
            last=mid-1
        else:
            first = mid +1
    return False