Insertion or Heap Sort

def solve(original, partial):
    original = list(map(int, original.split(',')))
    partial = list(map(int, partial.split(',')))
    n = len(original)
    is_insertion = False
    for i in range(1, n):
        if partial[:i+1] == sorted(partial[:i+1]) and partial[i+1:] == original[i+1:]:
            is_insertion = True
            break
    if is_insertion:
        print('Insertion Sort')
        i += 1
        if i < n:
            key = partial[i]
            j = i - 1
            while j >= 0 and partial[j] > key:
                partial[j + 1] = partial[j]
                j -= 1
            partial[j + 1] = key
    else:
        print('Heap Sort')
    print(' '.join(map(str, partial)))