Cfrtjryk

I tried to build simple code that solved square operational with value n using python, plus, I want to learn recursion. I made three different style code like this:

First code

def pangkat(nilai, pangkat):

    a = int(1)

    for i in range(pangkat):

        a = a * nilai

    return a



if __name__ == "__main__":

    print(pangkat(13, 8181))

Second Code

def pangkat(nilai, pangkat):

    hasil = nilai**pangkat

    return hasil



if __name__ == "__main__":

    print(pangkat(13, 8181))

Third Code

def pangkat(nilai, pangkatnilai):

    if pangkatnilai == 1:

        return nilai



    return nilai * pangkat(nilai, pangkatnilai-1)



if __name__ == "__main__":

    print(pangkat(13,8181))

Note: param nilai as number that will be raised, and pangkat as number that will raised param nilai), all of this code works well for example, when I fill the nilai and param.

Input 0

pangkat(13, 12)

Output 0

23298085122481

The problem occurred when I changed the param pangkat >= 1000, it will give me an error but only in the third code.

Traceback (most recent call last):

  File "pang3.py", line 8, in <module>

    print(pangkat(13,1000))

  File "pang3.py", line 5, in pangkat

    return nilai * pangkat(nilai, pangkatnilai-1)

  File "pang3.py", line 5, in pangkat

    return nilai * pangkat(nilai, pangkatnilai-1)

  File "pang3.py", line 5, in pangkat

    return nilai * pangkat(nilai, pangkatnilai-1)

  [Previous line repeated 995 more times]

  File "pang3.py", line 2, in pangkat

    if pangkatnilai == 1:

RecursionError: maximum recursion depth exceeded in comparison

While the first and second code works well, what could go wrong with my recursion function? Plus, I need an explanation for it.