How to use the Recursive algorithm of C # factorial

This article mainly explains how to use the recursive algorithm of C#factorial. Interested friends may wish to have a look. The method introduced in this paper is simple, fast and practical. Let's let Xiaobian take you to learn how to use the recursive algorithm of C#factorial.

Examples:

The following is a recursive algorithm for factorial, where the judgment condition returns num *Jc(num - 1) if num>0, otherwise it returns 1.

using System;using System.Collections.Generic;using System.Linq;using System.Text;using System.Threading.Tasks;namespace jiecheng{ class jiecheng { public int Jc(int num) { return num > 0 ? num *Jc(num - 1):1; //num *Jc(num - 1) if num>0, 1 otherwise } } class excutejiecheng { static void Main(string[] args) { jiecheng n = new jiecheng(); int result = n.Jc(Convert.ToInt16(Console.ReadLine())); Console.WriteLine("result is {0}",result); Console.ReadKey(); } }} At this point, I believe that everyone has a deeper understanding of "how to use the recursive algorithm of C#factorial," so let's actually operate it! Here is the website, more related content can enter the relevant channels for inquiry, pay attention to us, continue to learn!