Comparison between two different merge sort implementations explained

Question

I wrote my implementation like this:

def merge_sort(lst):
    if len(lst) < 2: return lst

    midx = len(lst) // 2