Efficenty: Recursion Assignment

#include <stdio.h>

int main()
{
  
   int testBase = 2; // Variable: the base for the exponent is 2
   int testExponent;
  
   // Note: 2^0 is our Trivial Case
  
   long testError = 1;
  
   int userInput;
  
   printf("[*] Input a number: ");
   scanf("%i", &userInput); // Note: starts acting 'weird' when 63 is inputted
  
   for( testExponent = userInput; testExponent != 0; --testExponent ) // While?
   {
      
       testError *= testBase;
      
       printf("[*] The number is: %li \n", testError);
      
   }
  
   printf("[COMPLETE] We are done! \n");
  
  
  
return 0;
}

def fact(z):
    return 1 if (z < 2) else z * fact(z-1)
 
print(fact(666))

def fact(z):
    num = 1 if (z < 2) else z * fact(z-1)
    print("Next number is:" + str(num) + "\n")
    return num
 
number = input("Enter a number: \n")
fact(int(number))

#include <stdio.h>

int getPow(int number, int exp) {
  if (exp < 1) {
    return 1;
  }else {
    return number * getPow(number, exp - 1);
  }
}

int main (int argc, char ** argv) {
  fprintf(stdout, "%d\n", getPow(10, 2));
  fprintf(stdout, "%d\n", getPow(3, 10));
  fprintf(stdout, "%d\n", getPow(4, 1));
  fprintf(stdout, "%d\n", getPow(5, 0));
  return 0;
}