def mergeSort(my_array):
    if len(my_array) > 1:
        div = len(my_array) // 2
        left_side = mergeSort(my_array[:div])
        right_side = mergeSort(my_array[div:])
        i = 0
        j = 0
        k = 0
        merged_array = []
        while k < len(my_array) and len(left_side) != i and len(right_side) != j:
            if left_side[i] < right_side[j]:
                merged_array.append(left_side[i])
                i+=1
            else:
                merged_array.append(right_side[j])
                j+=1
            k+=1
        if len(left_side) == i:
            merged_array += right_side[j:]
        elif len(right_side) == j:
            merged_array += left_side[i:]
        return merged_array
    else:
        return my_array