python中实现二分查找，插入排序，归并排序，快速排序

转载请注明出处http://blog.csdn.net/feimengjuan/article/details/46400303

1、二分查找

#二分查找
def BinarySearch(A,begin,end,key):
    index=-10
    mid=(begin+end)/2
    if A[mid]==key:
        index=mid
    if (A[mid]<key) & (begin<end):
        index=BinarySearch(A, mid+1, end, key)
    if (A[mid]>key) & (begin<end):
        index=BinarySearch(A, begin, mid-1, key)
    return index

</pre>2、插入排序<p></p><p></p><pre code_snippet_id="686724" snippet_file_name="blog_20150607_3_1166439" name="code" class="python">#插入排序
def InsertSort(A,begin,end):
    for j in range(1,len(A)):
        key=A[j]
        i=j-1
        while (i>=0) & (A[i]>key):
            A[i+1]=A[i]
            i=i-1
        A[i+1]=key