Question

Convert this pseudo code into python 3:

function msort(A,start,stop)

     if start >= stop then

            return

     end if

     Set middle = start+floor( (stop-start)/2 )

     msort(A,start,middle)

     msort(A,middle+1,stop)

     merge(A,start,middle,stop)

end function

Answer 1

Here implementation for merge function is not given so it is kept blank.

Other implementation is as follow.

import math
def msort(A,start,stop):
if start>=stop:
return #end if
middle = start + math.floor((stop-start)/2) #calculate middle
msort(A,start,middle) #recusrsive call to msort
msort(A,middle+1,stop) #recursive call to msort
merge(A,start,middle,stop) #method calling
  

#method definition for merge
def merge(A,start,middle,stop):
return

A=[2,6,3,98,45] #initialize the array
msort(A,0,4) #mehod calling