Слияние 2 неубывающих массивов с сохранением сортировки

def sum(lst1, lst2):
    pos1 = pos2 = 0
    res = []
    while pos1 < len(lst1) or pos2 < len(lst2):
        if lst1[pos1] < lst2[pos2]:
            res.append(lst1[pos1])
            pos1 += 1
        else:
            res.append(lst2[pos2])
            pos2 += 1
    return res
 
list1 = [0, 2, 10]          # map(int, input().split())
list2 = [1, 2, 3, 5, 11]    # map(int, input().split())
list3 = sum(list1, list2)
print(list)

def sum(lst1, lst2):
    pos1 = pos2 = 0
    res = []
    #while pos1 < len(lst1) or pos2 < len(lst2):
    while pos1 < len(lst1) and pos2 < len(lst2):
        if lst1[pos1] < lst2[pos2]:
            res.append(lst1[pos1])
            pos1 += 1
        else:
            res.append(lst2[pos2])
            pos2 += 1
            
    ###########
    if pos1 < len(lst1):
        res.extend(lst1[pos1:])
    else:
        res.extend(lst2[pos2:])
    ###########
    
    return res
 
list1 = [0, 2, 10] # map(int, input().split())
list2 = [1, 2, 3, 5, 11] # map(int, input().split())
list3 = sum(list1, list2)
print(list3)

def my_merge(L, R):
    #==========================================================================
    def add( pL, pR, L, R, res ):
        while pL < len(L) and ( pR == len(R) or L[pL] <= R[pR] ):
            res.append( L[pL] )
            pL += 1
        return pL, pR, L, R, res
    # ==========================================================================
    pL = pR = 0
    res = []
    while pR < len(R) or pL < len(L):
        pL, pR, L, R, res = add( pL, pR, L, R, res )
        pR, pL, R, L, res = add( pR, pL, R, L, res )
    return res
#==============================================================================
L = [0, 3, 2000, 10000]
R = [1, 2, 3, 5, 11, 50000]
res = my_merge(L, R)
print(res)

import timeit
 
f = """\
k = 2 > 1
"""
 
g = """\
k = 2 > len([1])
"""
 
 
print(timeit.timeit(stmt=g, number=10000000))
print(timeit.timeit(stmt=f, number=10000000))

import timeit
 
f = """\
a = [1]*1000000
n = len(a)
k = 0
while k<n:
    k += 1
"""
 
g = """\
a = [1]*1000000
k = 0
while k<len(a):
    k += 1
"""
 
 
print(timeit.timeit(stmt=g, number=1))
print(timeit.timeit(stmt=f, number=1))

import time
x = [1] * 100
y = [1] * 10000000
n = 10000000
start_time = time.time()
for _ in range(n):
    k = 2 > len(x)
print("--- %s seconds ---" % (time.time() - start_time))
start_time = time.time()
for _ in range(n):
    k = 2 > len(y)
print("--- %s seconds ---" % (time.time() - start_time))
 
--- 1.0352303981781006 seconds ---
--- 1.1150522232055664 seconds ---