piscine-c06-tmp/ex01/ft_recursive_factorial.c

38 lines
1.5 KiB
C

/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_recursive_factorial.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: tosuman </var/spool/mail/tosuman> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/03/30 16:54:29 by tosuman #+# #+# */
/* Updated: 2023/03/30 16:54:30 by tosuman ### ########.fr */
/* */
/* ************************************************************************** */
int ft_recursive_factorial(int nb)
{
if (nb < 1)
return (nb == 0);
return (nb * ft_recursive_factorial(nb - 1));
}
/* ////
#include <stdio.h>
int main(void)
{
printf("-10: %d\n", ft_recursive_factorial(-10));
printf("-1: %d\n", ft_recursive_factorial(-1));
printf("0: %d\n", ft_recursive_factorial(0));
printf("1: %d\n", ft_recursive_factorial(1));
printf("2: %d\n", ft_recursive_factorial(2));
printf("3: %d\n", ft_recursive_factorial(3));
printf("4: %d\n", ft_recursive_factorial(4));
printf("5: %d\n", ft_recursive_factorial(5));
printf("10: %d\n", ft_recursive_factorial(10));
printf("15: %d\n", ft_recursive_factorial(15));
return (0);
}
*/ ////