int main() { int res; res = ft_recursive_power(25,5); printf("%d\n", res); return(0); }
int ft_recursive_power(int nb, int power) { if (power == 0) return (1); if (power > 0) return (nb * ft_recursive_power(nb, power - 1)); }
int ft_recursive_power(int nb, int power) { if (power <= 0) return (0); while (power != 1) return (nb * ft_recursive_power(nb , power - 1)); }
void test(int nb, int power) { int resulta; resulta = ft_recursive_power(nb, power); ft_putnbr(resulta); ft_putchar('\n'); }
int ft_recursive_power(int nb, int power) { if (power < 0) return (0); if (power == 0) return (1); return (nb * (ft_recursive_power(nb, power - 1))); }
unsigned int ft_active_bits(int value) { unsigned int k; k = 0; while (ft_recursive_power(2, k) < value) k++; return (k + 1); }
int ft_recursive_power(int nb, int power) { if (power == 0) return (1); else if (power < 0) return (0); else return (nb * ft_recursive_power(nb, power - 1)); }
int ft_recursive_power(int nb, int power) { if (power > 1) return (nb * ft_recursive_power(nb, (power - 1))); if (power == 1) return (nb); if (!power) return (1); return (0); }
int ft_recursive_power(int nb, int power) { if (power < 0) { return (0); } else if (power == 1) return (nb); else return (nb * ft_recursive_power(nb, --power)); }
int ft_recursive_power(int n, int pow) { if (pow > 1) return (n * ft_recursive_power(n, pow - 1)); else if (pow == 0) return (1); else if (pow < 0) return (0); else return (n); }
int ft_recursive_power(int nb, int power) { int res; res = 1; if (power < 0) res = 0; else if (power > 0) res = nb * ft_recursive_power(nb, power - 1); return (res); }
int ft_recursive_power(int nb, int power) { if (power < 0) return 0; else if (power == 0) return 1; else if (power == 1) return nb; else nb = nb * ft_recursive_power(nb, (power - 1)); return nb; }
int ft_recursive_power(int nb, int power) { int result; result = nb; if (power < 0) return (0); if (power == 0) return (1); result = result * ft_recursive_power(nb, power - 1); return (result); }
unsigned char swap_bits(unsigned char octet) { int i; int j; int n1; int n2; i = 4; j = 0; n1 = octet; n2 = 0; while (n1 > 0) { if (i < 8) n2 += (n1 % 2) * ft_recursive_power(2, i++); else n2 += (n1 % 2) * ft_recursive_power(2, j++); n1 /= 2; } return (n2); }
int ft_recursive_power(int nb, int power) { int result; result = 1; if(power <= 0) { return result; } else { result = nb * ft_recursive_power(nb,power-1); } return result; }
int ft_recursive_power(int nb, int power) { if (power == 0) { return (1); } if (power < 0) { return (0); } else { return (nb * ft_recursive_power(nb, (power - 1))); } }
int ft_recursive_power(int nb, int power) { if (power < 0) { return (0); } else if (power == 0) { return (1); } else { return (ft_recursive_power(nb, power - 1) * nb); } }
int ft_recursive_power(int nb, int power) { int result; if (power < 0 || nb < 0) return (0); else if (power == 1) return (1); else if (power <= 1) return (1); else { result = nb * nb; return (result = nb * ft_recursive_power(nb, power - 1)); } }
int ft_find_next_prime(int nb) { if (ft_is_prime(nb)) return (nb); if (nb <= 2) return (2); if ((nb % 2) == 0) nb++; while (nb < (ft_recursive_power(2, 31)) - 1) { if (ft_is_prime(nb)) return (nb); nb += 2; } return (-1); }
unsigned char reverse_bits(unsigned char octet) { int i; int n1; int n2; i = 7; n1 = octet; n2 = 0; while (n1 > 0) { n2 += (n1 % 2) * ft_recursive_power(2, i--); n1 /= 2; } return (n1); }
unsigned int ft_bintodec(unsigned int n) { int dec; int i; int rem; dec = 0; i = 0; while (n != 0) { rem = n % 10; n /= 10; dec += rem * ft_recursive_power(2, i); ++i; } return (dec); }
int main(void) { printf("%d", ft_recursive_power(-1, 5)); ft_putchar('\n'); printf("%d", ft_recursive_power(0, 5)); ft_putchar('\n'); printf("%d", ft_recursive_power(5, 5)); ft_putchar('\n'); printf("%d", ft_recursive_power(10, 15)); ft_putchar('\n'); printf("%d", ft_recursive_power(-1, -1)); ft_putchar('\n'); printf("%d", ft_recursive_power(5, -1)); ft_putchar('\n'); printf("%d", ft_recursive_power(5, 0)); ft_putchar('\n'); printf("%d", ft_recursive_power(-5, -5)); ft_putchar('\n'); return (0); }
int ft_recursive_power(int nb, int power) { if (power < 0) { return (0); } else if (power == 0) { return 1; } if (power != 1) { return (nb * ft_recursive_power(nb, power - 1)); } else { return nb; } }
int ft_recursive_power(int nb, int power) { int a; a = nb; if (power < 0 || (nb == 0 && power != 0)) { return (0); } if (power == 0) { return (1); } if (nb != 0 && power != 0 && power > 0 && power > 1) { return (nb * ft_recursive_power(nb, power - 1)); } return (nb); }
int ft_recursive_power(int nb, int power) { if (power < 0) return (0); else { if (power == 0) return (1); else { if (power == 1) return (nb); else { nb *= ft_recursive_power(nb, power - 1); return (nb); } } } }
int ft_convert_ten(char *nbr, char *base_from) { int i; int j; int k; int result; int n; i = ft_strlen(nbr) - 1; j = ft_strlen(base_from); result = 0; n = 0; while (i > -1) { k = 0; while (base_from[k] != nbr[n]) k++; result = result + k * ft_recursive_power(j, i); i--; n++; } return (result); }
int main(void) { printf("%d", ft_recursive_power(7, 4)); return (0); }
int main() { int v = ft_recursive_power(3,3); printf("%d",v); }
/* ************************************************************************** */ int ft_recursive_power(int nb, int power) { if (power >= 0 && nb > 0) return (power == 0) ? (nb) : (nb * ft_recursive_power(nb, --power)); return (0); }