sort merge implementation

def merger(array1,array2):
    '''
    (list,list) -> list
    take two sorted list and merge them into a sorted list
    >>> merger([1,3],[2,4]
    [1,2,3,4]
    '''
    i,j,l1,l2 = 0,0,len(array1), len(array2)
    l = l1+l2
    merge = []
    for k in range(0,l):
        if i < l1 and j < l2:
            if array1[i] <= array2[j]:
               merge.append(array1[i])
               i +=1
            else:
               merge.append(array2[j])
               j +=1 
        elif i >= l1 and j < l2:
            merge.append(array2[j])
            j+=1
        elif i <= l1 and j >= l2:
            merge.append(array1[i])
            i+=1
    return merge

def merge_sort(array):
    if len(array) <=1:
        return array	
    l = len(array)
    h = int(l/2)
    array1, array2 = array[0:h], array[h:l]
    sarray1,sarray2 = merge_sort(array1),merge_sort(array2)
    return merger(sarray1,sarray2)
        
if __name__ == "__main__":
    #import doctest 
    #doctest.testmod() #assert merger([1,3],[2,4,5])==[1,2,3,4,5]
    #print merger([1,3],[2,5])==[1,2,3,5]
    print merge_sort([1,3,2,5,4])==[1,2,3,4,5]

Browser Version Not Supported

Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+ Firefox 4+ Safari 5+
IE 10+

Let me try anyway!

Python Fiddle

Python Cloud IDE