Merge Sort Algorithm in Python

Merge sort is a divide and conquer algorithm that works as follows.. If the length of the given list is more than 1, divide it into n sublists using recursion, each containing 1 element because a list containing 1 element is always sorted. Again using …