c to python converter

1import sys
2
3def mergesort_2ndstep(l, r):
4	len_l = len(l)
5	len_r = len(r)
6	# initializing a list of length zero
7	sorted_array = []
8	i,j = 0,0
9	while i < len_l:
10		num1 = l[i]
11		for x in range(j,len_r):
12			num2 = r[x]
13			if num2 < num1 :
14				sorted_array.append(num2)
15				j += 1
16		
17		sorted_array.append(num1)
18		i += 1
19
20	if len(sorted_array) != len_l + len_r:
21		# Checking extreme conditions
22		sorted_array[i+j:] = r[j:]
23	return sorted_array
24
25
26def mergesort_1ststep(L,start,stop):
27	# a list can be divided into two 
28	# if length of list is atleast two
29	if stop - start > 1:
30		l = mergesort_1ststep(L,start,start + (stop-start)//2)
31		r = mergesort_1ststep(L,start + (stop-start)//2,stop)
32		# mergeing two lists(sorting the l and r parts)
33		L[start:stop] = mergesort_2ndstep(l,r)
34	return L[start:stop]
35
36# START
37List_of_nums = []
38file_to_open = "input1.txt"
39
40try:
41	read_file = open(file_to_open,"r")
42	write_file = open("sameeraz.txt","w")
43	if read_file != None:
44		# appending every num from file to list_of_nums
45		for line in read_file:
46			line = int(line)
47			List_of_nums.append(line)
48		# applying mergesort
49		mergesort_1ststep(List_of_nums,0, len(List_of_nums))
50		# writing to an output file
51		# excluding the last element 
52		k = List_of_nums.pop()
53		for num in List_of_nums:
54			write_file.write(f"{num}\n")
55		# writing last element without next line
56		write_file.write(f"{k}")
57	
58		read_file.close()
59		write_file.close()
60except:
61	print("file not found")