Question: 
Write a function to find kth element from the given two sorted arrays.


Model's Code:
def find_kth(arr1, arr2, n1, n2, k):
    if n1 > n2:
        return find_kth(arr2, arr1, n2, n1, k)
    if n1 == 0:
        return arr2[k-1]
    if k == 1:
        return min(arr1[0], arr2[0])
    
    i = min(n1, k // 2)
    j = k - i
    
    if arr1[i - 1] < arr2[j - 1]:
        return find_kth(arr1[i:], arr2, n1 - i, n2, k - i)
    else:
        return find_kth(arr1, arr2[j:], n1, n2 - j, k - j)



Sample Correct Code:
def find_kth(arr1, arr2, m, n, k):
	sorted1 = [0] * (m + n)
	i = 0
	j = 0
	d = 0
	while (i < m and j < n):
		if (arr1[i] < arr2[j]):
			sorted1[d] = arr1[i]
			i += 1
		else:
			sorted1[d] = arr2[j]
			j += 1
		d += 1
	while (i < m):
		sorted1[d] = arr1[i]
		d += 1
		i += 1
	while (j < n):
		sorted1[d] = arr2[j]
		d += 1
		j += 1
	return sorted1[k - 1]


Asserts:
assert find_kth([2, 3, 6, 7, 9], [1, 4, 8, 10], 5, 4, 5) == 6
assert find_kth([100, 112, 256, 349, 770], [72, 86, 113, 119, 265, 445, 892], 5, 7, 7) == 256
assert find_kth([3, 4, 7, 8, 10], [2, 5, 9, 11], 5, 4, 6) == 8


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 597 of 974: 444/597 (74.37185929648241%): success