Question

The language is python

I Expert Q&A Done The language is python. 10. The following is the algorithm for Merge Sort, one of the best sorting algorithms and one hat is recursive. Wine the merge sort function and draw the stack and heap dagrams for execution on the list |5, 8,9,1,4. 10 Algorithm: Mergesort Ingut an unsorted list b 1. If there is only one iten L. It is sorted, return L 2, Split L Sn half and and assign results to S and T. . 5-RergeSort(s) Output Merge(s,T Algorithm: Merg Input Tue sorted lists S and T 1. Create a new list R 2. While 5 er T have items in them: a. Take the minimun of the two first itens E b. Renove k from its list and put into .Append the renaining itens in the non-enpty list to R Output R shouid be able to call the function like this ylist- [S, 8,9 1, 4, 101 sorted 1ist serge, sort (nylist) For this diagram, include the recursive calls in the call stack

thr language is python

Answer 1

code:

def merge_sort(alist):
if len(alist)>1:
mid = len(alist)//2
S = alist[:mid]
T = alist[mid:]
merge_sort(S)
merge_sort(T)
merge(alist,S,T)
return alist

def merge(alist,S,T):
   i=0
   j=0
   k=0
   while i < len(S) and j < len(T):
       if S[i] < T[j]:
           alist[k]=S[i]
           i=i+1
       else:
           alist[k]=T[j]
           j=j+1
       k=k+1
   while i < len(S):
       alist[k]=S[i]
       i=i+1
       k=k+1
   while j < len(T):
       alist[k]=T[j]
       j=j+1
       k=k+1

my_list=[5,8,9,1,4,10]
sorted_list=merge_sort(my_list)
print(sorted_list)

Indendation reference:

def merge sort(alist): if len(alist) 1: mid len(alist)//2 s - alist:mid T alist[mid:] print("s" ,s) merge_sort(S) print("t",T) merge_sort(T) merge(alist,s,T) return alist def merge(alist,S,T): k-0 while i <len(S) and j len(T): if S[i] 〈 T[j]: alist[k]-s[i] else: alist[k]-TI] k-k+1 while i len(s): 〈 alist[k]-s[i] i-i+1 k-k+1 while j len(T): 〈 alist[k]-T[j] J-J+1 k-k+1 my list [5,8,9,1,4,101 sorted_list-merge_sort (my_list) print(sorted_list)

Sample i/o:

C:\Usersl sushman-pt2558\Desk [1, 4, 5, 8, 9, 10]

Stack Calls:

meao sorCL&,1,4,0 Mee SortL, r,49丁 moxy-ort() mengrt C41 (CoJ) Heure. Stade Gaul ell, menge-Sort(Ca) menge -sort(cp mey , 4 lo]) mera-sort (C,&,91

e-Sor mese.sort( Ca meney-sort (C