Problem in QUICKSORT question

this is my code:
N=int(input())
arr=[]
s=input()
s=s.replace(" “,”")
for i in s:
arr.append(int(i))

def merge(arr, l, m, r):
n1 = m - l + 1
n2 = r- m

L = [0] * (n1) 
R = [0] * (n2) 

for i in range(0 , n1): 
    L[i] = arr[l + i] 

for j in range(0 , n2): 
    R[j] = arr[m + 1 + j] 

i = 0     
j = 0      
k = l     

while i < n1 and j < n2 : 
    if L[i] <= R[j]: 
        arr[k] = L[i] 
        i += 1
    else: 
        arr[k] = R[j] 
        j += 1
    k += 1

while i < n1: 
    arr[k] = L[i] 
    i += 1
    k += 1

while j < n2: 
    arr[k] = R[j] 
    j += 1
    k += 1

def mergeSort(arr,l,r):
if l < r:

    m = (l+(r-1))//2
    myarray=[]
    mergeSort(arr, l, m) 
    mergeSort(arr, m+1, r) 
    merge(arr, l, m, r)

mergeSort(arr,0,N-1)
for i in arr:
print(i, end=" ")

where am i going wrong?

plzz help as i have reached the deadline today.