Merge vs Insertion Sort

def swap (a,i,j):
    t=a[i]
    a[i]=a[j]
    a[j]=t

def insort1(A,b):
    if b==1:
        return
    insort1(A,b-1)
    key=A[b-1]
    i=b-2
    while i>=0 and A[i]>key:
        A[i+1]=A[i]
        i-=1
    A[i+1]=key

def insort2(A,b):
    if b==1:
        return
    insort2(A,b-1)
    for i in range(b-1,0,-1):
        if A[i]>A[i-1]:
            break
        else:
            swap(A,i,i-1)

def mergee(a,s,m,e):
    n1 = m-s+1
    n2 = e-m
    a1 = a[s:(m+1)]
    a2 = a[(m+1):(e+1)]
    i = 0
    j = 0
    for k in xrange(s,e+1):
        if i>=n1:
            a[k:(e+1)] = a2[j:]
            break
        elif j>=n2:
            a[k:(e+1)] = a1[i:]
            break
        else:
            if a1[i]<a2[j]:
                a[k] = a1[i]
                i += 1
            else:
                a[k] = a2[j]
                j += 1
    

def mesort(A,n):
    mesort_helper(A,0,n-1)

def mesort_helper(A,i,j):
    if i==j:
        return
    half=int((i+j)/2)
    mesort_helper(A,i,half)
    mesort_helper(A,half+1,j)
    mergee(A,i,half,j)

import random
tests = [range(-10,11),
         range(-100,111,5),
         range(-10000,11111,40)]

def testIt(fun):
    n = len(tests)
    correct = n
    for test in tests:
        temp = test[:]
        random.shuffle(temp)
        fun(temp,len(temp))
        if temp != test:
            mistakes -= 1
    #print '%d/%d tests passed' % (correct,n)
    

%timeit testIt(insort1)

%timeit testIt(insort2)

%timeit testIt(mesort)