Calculate Factorial with recursive function - CSharp Data Structure Algorithm

Description

Calculate Factorial with recursive function

Demo Code

using static System.Console;
class Program/*from w w  w.ja  va2s.  c  o m*/
{
   static int Factorial(int number)
   {
      if (number < 1)
      {
         return 0;
      }
      else if (number == 1)
      {
         return 1;
      }
      else
      {
         return number * Factorial(number - 1);
      }
   }
   static void Main(string[] args)
   {
      Write("Enter a number: ");
      if (int.TryParse(ReadLine(), out int number))
      {
         WriteLine(
         $"{number:N0}! = {Factorial(number):N0}");
      }
      else
      {
         WriteLine("You did not enter a valid number!");
      }
   }
}

Result

• Previous
• Next

Related Tutorials

• Calculates the sum of the first N members of the sequence of Fibonacci: 0, 1, 1, 2, 3, 5, 8, 13, 21,
• For a given two integer numbers N and X, calculates the sumS = 1 + 1!/X + 2!/X2 + ... + N!/XN
• Calculates N!/K! for given N and K (1<K<N).
• Create a factorial program that returns an error indication when something goes wrong.
• Create a factorial program that reports illegal Factorial() arguments using an Exception.