Page Title

FACTORIAL RECURSION

 
  var x: Int?
  var fact: Int=1

  func factorial(x: Int)->Int{
    for i in 1...x{
        fact=fact*i
    }
    return fact
  }
 
  print(factorial(x:3))

See Swift Code

  import java.util.Scanner;

      public class Program{
          public static void main(String[] args) {
    
              Scanner sc=new Scanner(System.in);
              long num=sc.nextLong();
              if(num>35){
               System.out.println("Ingrese un numero menor a 35");
              }else{
                  long fact=factorial(num);
                  System.out.println(fact);
              }
          } 
       
           //metodo recursivo
           public static long factorial(long x){
              if(x<=1){
                  return 1;
              }else{
                  return x * factorial(x-1);
              }
           } 
      }

See Java Code

  def factorial(x):
    if x<=1:
        return 1
    else:
        return x*factorial(x-1)
        
  numero=int(input())
  print(factorial(numero))

See Python Code

  #Metodo recursivo
  def factorial(x)
      if x<=1
          1
      else
          x * factorial(x-1)
      end
  end
  #Llamado al metodo recursivo
  puts factorial(gets.chomp.to_i)

See Ruby Code

  #include 
  //Metodo Recursivo
  long factorial(log num){
    if(num <=1){
        return 1;
    }else{
        return num * factorial(num-1);
    }
  }
  //Main
  int main() {
    long num;
    scanf("%ld",&num);
    
    if(num>35){
        printf("Ingrese un numero menor 35");
    }else{
        long facto=factorial(num);
        printf("Factorial %ld is %ld",num,facto);
    }
    return 0;
  }

See C Code

  fun factorial(x: Long): Long {
    if(x<=1){
        return 1;
    }else{
        return x*factorial(x-1);
    }
  }

  fun main(args: Array) {
    var num=readLine()!!.toLong();
    if( num>35){
        println("Ingrese un numero menor de 35");
    }else{
        println(factorial(num));
    }
  }

See Kotlin Code

 using System;
 using System.Collections.Generic;
 using System.Linq;
 using System.Text;
 using System.Threading.Tasks;

 namespace SoloLearn
 {
    class Program
    {
        //Metodo Recursivo
        static long factorial(long num) 
        {
            if(num<=1){
                return 1;
            }else{
                return num * factorial(num-1);
            }
        }
        
        //Menu y llamado al metodo 
        static void Main(string[] args)
        {
           long num=long.Parse(Console.ReadLine());
           if(num>35){
               Console.WriteLine("Ingrese un numero menor a 35");
           }else{
               Console.WriteLine(factorial(num));
           }
        }
     }
  }

See C# Code

 #include 
 using namespace std;

 //Metodo Recursivo
 long factorial(long num) {
    if(num<=1){
        return 1;
    }else{
        return num * factorial(num-1);
    }
 }

 int main() {
    long num;
    cin>>num;
    
    if(num>35){
        cout << "Ingrese un numero menor a 35";
    }else{
        cout << factorial(num);
    }
 }

See C++ Code

  <?php
    function fact($num){
       if($num == 1) {
          return 1; 
       } else {
          return $num * fact($num - 1);
       }
    }
    
    echo fact(5);
    
  ?>

See PHP Code

Recursion All