源码网商城,靠谱的源码在线交易网站 我的订单 购物车 帮助

源码网商城

C# 实现阶乘 (递归,非递归) 实现代码

  • 时间:2020-11-21 22:13 编辑: 来源: 阅读:
  • 扫一扫,手机访问
摘要:C# 实现阶乘 (递归,非递归) 实现代码
//Main:
[u]复制代码[/u] 代码如下:
using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace Factorial {     class Program     {         static void Main(string[] args)         {             Function obj = new Function();             Console.WriteLine("Would you like to know which number of Factorial:");             int number = Convert.ToInt32(Console.ReadLine());             Console.WriteLine();             Console.Write("The Fibonacci of {0} is:{1}", number, obj.Factorial(number));             Console.WriteLine();             Console.Write("The FactorialRecursion of {0} is:{1}", number, obj.FactorialRecursion(number));             Console.ReadKey();         }     } }
 //Class:  
[u]复制代码[/u] 代码如下:
 using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace Factorial {     class Function     {         /// <summary>         /// Factorial定义为:         ///      ┌ 1        n=0               ///   N!=│         ///      └ n(n-1)!  n>0         /// </summary>         /// <param name="number"></param>         /// <returns></returns>         public int Factorial(int number)         {             if (number != 0)             {                 return number * Factorial(number - 1);             }             else if (number == 0)             {                 return 1;             }             return number;         }         public int FactorialRecursion(int number)         {             int F = 1;             for (int i = 1; i <= number; i++)             {                 F *= i;             }             return F;         }     } }
截图: [img]http://files.jb51.net/file_images/article/201305/201353103302848.jpg[/img]
  • 全部评论(0)
联系客服
客服电话:
400-000-3129
微信版

扫一扫进微信版
返回顶部