Merge Sort

Merge-Sort.py

'''-------------------------------------------------------------------------------------------------------------------------
--------------------------------------------------MERGE SORT-------------------------------------------------------------
-------------------------------------------------------------------------------------------------------------------------'''

def merge_sort(unsorted_list):
    if len(unsorted_list) == 1:
        return unsorted_list

    mid = len(unsorted_list)//2

    right = unsorted_list[mid:]
    left = unsorted_list[:mid]

    right = merge_sort(right)
    left = merge_sort(left)

    return merge(right, left)
    

def merge(right, left):
    res= []
    while len(right) != 0 and len(left) != 0:
        if right[0] > left[0]:
            res.append(left[0])
            left.remove(left[0])
        else:
            res.append(right[0])
            right.remove(right[0])
    
    if len(right) == 0:
        res= res + left
    else:
        res = res + right
    
    return res

unsorted_list = [9,8,7,6,5,4,3,2,1]
print(merge_sort(unsorted_list))

'''///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
----------------------------------COMPLEXITY = O(n*log(n))[Worst case] / O(n*log(n))[Best Case]----------------------------
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////'''