如何将此递归函数转换为迭代函数

def recursive_function(n):
    if n <= 0:
        return
    print(n)
    recursive_function(n-1)

def iterative_function(n):
    stack = []
    while True:
        if n > 0:
            stack.append(n)
            n -= 1
            continue
        if len(stack) == 0:
            break
        n = stack.pop()
        print(n)
        n -= 1