Implementing power function in two different ways. What’s the big O difference between these two codes?

1:

Big O runtime for a queens bruteforce algorithm

I’m solving Big O runtimes but do not feel as though I understand the problem thoroughly enough to answer on my own.