CIS3301-CODE-13-Merge-Sort-Recursion Instructions In this CODE assignment you are asked to implement in Python the merge sort algorithm.

In this CODE assignment you are asked to implement in Python the merge sort algorithm. Implement your code in code_13.py. To test your code, call your functions inside the if __name__ == "__main__": ...

Merge sort is a sorting algorithm that uses "Divide and Conquer" method to sort the array.It divides the array into two halves and then recursively sort the two sub-array and then merge the two sorted ...