We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 30 Days of Code
  4. Day 9: Recursion 3
  5. Discussions

Day 9: Recursion 3

Sort by

recency

|

1153 Discussions

|

  • fran_delgado_ca1
     + 0 comments

    JS

    function factorial(n) {
    return n === 1 ? 1 : n * factorial(n-1);
}

  • sivaram_movva1
     + 0 comments

    c#

    public static int factorial(int n)

    {

                return n>1?n*factorial(n-1):1;

    }

  • siangba_manga_m1
     + 0 comments

    Python : 

    def factorial(n):
    return 1 if n<=1 else n*factorial(n-1)

  • chetan_kumar96
     + 0 comments

    code in python 3

    def factorial(n):
    if n == 0:
        f_ct = 1
        return f_ct
    else:
        f_ct = n*factorial(n-1)
        return f_ct

  • jonah38
     + 1 comment

    See a lot of solutions using logic, isn't the simplest (in JS)

    function factorial(n) {
    // Write your code here
    var f = 1
    for (let i = 1; i <= n; i++){
        f *= i 
    }
    return f
}