第三次作業 -- 遞迴 請寫出 n! 的遞迴程式

[ccckmit]

提示 ： f(n) = ? f(n-1) ....

[istar0me]

iterate

function factorial(n) {
    let sum = 1;
    for (i=1; i<=n; i++) {
       sum *= i 
    }
    return sum
}
console.log(factorial(3)) // 6

recursion

function factorialR(n) {
    if (n <= 1) {
        return 1;
    } else { 
        return n * factorialR(n-1);
    }
}
console.log(factorialR(5)) // 120

[ChiaYuSu]

#include <stdio.h>
 
int factorial(int n);

int main()
{
  int number;
  printf("Please enter an integer: ");
  scanf("%d", &number);
  printf("%d! = %d\n", number, factorial(number));
  return 0;
}
 
int factorial(int n)
{
  int i;
  int total = 1;
  for (i = 1 ; i <= n ; i++) {
  	total = total * i;
  }
  return total;
}

[tian0108]

110410428田宇軒
https://github.com/tian0108/ai107b/blob/master/homework/n!/n!.cpp