w3resource logo
C# Sharp Programming Exercises

C# Sharp Exercises: Find the factorial of a given number

C# Sharp Recursion: Exercise-9 with Solution

Write a program in C# Sharp to find the factorial of a given number using recursion.

Sample Solution:-

C# Sharp Code:

using System;

class RecExercise9
    {
        static void Main(string[] args)
        {
			Console.WriteLine("\n\n Recursion : Find the factorial of a given number :");
			Console.WriteLine("-------------------------------------------------------");
	
			Console.Write(" Input any positive number : ");
            int n1 = Convert.ToInt32(Console.ReadLine());
            long fact = FactorialCalcu(n1);
            Console.WriteLine(" The factorial of {0} is : {1} ", n1, fact);           
            Console.ReadKey();
        }
 
        private static long FactorialCalcu(int n1)
        {          
            if (n1 == 0)
            {
                return 1;
            }
            return n1 * FactorialCalcu(n1-1);
        }
    }
	

Sample Output:

 Recursion : Find the factorial of a given number :                                                           
-------------------------------------------------------                                                       
 Input any positive number : 8                                                                                
 The factorial of 8 is : 40320  

C# Sharp Code Editor:

using System;

class RecExercise9
    {
        static void Main(string[] args)
        {
			Console.WriteLine("\n\n Recursion : Find the factorial of a given number :");
			Console.WriteLine("-------------------------------------------------------");
	
			Console.Write(" Input any positive number : ");
            int n1 = Convert.ToInt32(Console.ReadLine());
            long fact = FactorialCalcu(n1);
            Console.WriteLine(" The factorial of {0} is : {1} ", n1, fact);           
            Console.ReadKey();
        }
 
        private static long FactorialCalcu(int n1)
        {          
            if (n1 == 0)
            {
                return 1;
            }
            return n1 * FactorialCalcu(n1-1);
        }
    }

Improve this sample solution and post your code through Disqus