Heap's algorithm in Python

heaps.py

from typing import List


def swap(A, i, j):
    temp = A[i]
    A[i] = A[j]
    A[j] = temp


def generate(k: int, A: List):
    if k == 1:
        return [A.copy()]
    else:
        res = generate(k - 1, A)

        for i in range(k - 1):
            if k % 2 == 0:
                swap(A, i, k - 1)
            else:
                swap(A, 0, k - 1)
            res = res + generate(k - 1, A)
        return res

def yield_generate(k: int, A: List):
    if k == 1:
        yield A.copy()
    else:
        yield from generate(k - 1, A)

        for i in range(k - 1):
            if k % 2 == 0:
                swap(A, i, k - 1)
            else:
                swap(A, 0, k - 1)
            yield from generate(k - 1, A)

l = list(range(14))
val = yield_generate(len(l), l)
for i in val:
    print(i)