C#实现斐波那契数列的几种方法整理
作者:快乐泥巴 时间:2023-09-02 05:05:58
什么是斐波那契数列?经典数学问题之一;斐波那契数列,又称黄金分割数列,指的是这样一个数列:1、1、2、3、5、8、13、21、……想必看到这个数列大家很容易的就推算出来后面好几项的值,那么到底有什么规律,简单说,就是前两项的和是第三项的值,用递归算法计第50位多少。
这个数列从第3项开始,每一项都等于前两项之和。
斐波那契数列:{1,1,2,3,5,8,13,21...}
递归算法,耗时最长的算法,效率很低。
public static long CalcA(int n)
{
if (n <= 0) return 0;
if (n <= 2) return 1;
return checked(CalcA(n - 2) + CalcA(n - 1));
}
通过循环来实现
public static long CalcB(int n)
{
if (n <= 0) return 0;
var a = 1L;
var b = 1L;
var result = 1L;
for (var i = 3; i <= n; i++)
{
result = checked(a + b);
a = b;
b = result;
}
return result;
}
通过循环的改进写法
public static long CalcC(int n)
{
if (n <= 0) return 0;
var a = 1L;
var b = 1L;
for (var i = 3; i <= n; i++)
{
b = checked(a + b);
a = b - a;
}
return b;
}
通用公式法
/// <summary>
/// F(n)=(1/√5)*{[(1+√5)/2]^n - [(1-√5)/2]^n}
/// </summary>
/// <param name="n"></param>
/// <returns></returns>
public static long CalcD(int n)
{
if (n <= 0) return 0;
if (n <= 2) return 1; //加上,可减少运算。
var a = 1 / Math.Sqrt(5);
var b = Math.Pow((1 + Math.Sqrt(5)) / 2, n);
var c = Math.Pow((1 - Math.Sqrt(5)) / 2, n);
return checked((long)(a * (b - c)));
}
其他方法
using System;
using System.Diagnostics;
namespace Fibonacci
{
class Program
{
static void Main(string[] args)
{
ulong result;
int number = 10;
Console.WriteLine("************* number={0} *************", number);
Stopwatch watch1 = new Stopwatch();
watch1.Start();
result = F1(number);
watch1.Stop();
Console.WriteLine("F1({0})=" + result + " 耗时:" + watch1.Elapsed, number);
Stopwatch watch2 = new Stopwatch();
watch2.Start();
result = F2(number);
watch2.Stop();
Console.WriteLine("F2({0})=" + result + " 耗时:" + watch2.Elapsed, number);
Stopwatch watch3 = new Stopwatch();
watch3.Start();
result = F3(number);
watch3.Stop();
Console.WriteLine("F3({0})=" + result + " 耗时:" + watch3.Elapsed, number);
Stopwatch watch4 = new Stopwatch();
watch4.Start();
double result4 = F4(number);
watch4.Stop();
Console.WriteLine("F4({0})=" + result4 + " 耗时:" + watch4.Elapsed, number);
Console.WriteLine();
Console.WriteLine("结束");
Console.ReadKey();
}
/// <summary>
/// 迭代法
/// </summary>
/// <param name="number"></param>
/// <returns></returns>
private static ulong F1(int number)
{
if (number == 1 || number == 2)
{
return 1;
}
else
{
return F1(number - 1) + F1(number - 2);
}
}
/// <summary>
/// 直接法
/// </summary>
/// <param name="number"></param>
/// <returns></returns>
private static ulong F2(int number)
{
ulong a = 1, b = 1;
if (number == 1 || number == 2)
{
return 1;
}
else
{
for (int i = 3; i <= number; i++)
{
ulong c = a + b;
b = a;
a = c;
}
return a;
}
}
/// <summary>
/// 矩阵法
/// </summary>
/// <param name="n"></param>
/// <returns></returns>
static ulong F3(int n)
{
ulong[,] a = new ulong[2, 2] { { 1, 1 }, { 1, 0 } };
ulong[,] b = MatirxPower(a, n);
return b[1, 0];
}
#region F3
static ulong[,] MatirxPower(ulong[,] a, int n)
{
if (n == 1) { return a; }
else if (n == 2) { return MatirxMultiplication(a, a); }
else if (n % 2 == 0)
{
ulong[,] temp = MatirxPower(a, n / 2);
return MatirxMultiplication(temp, temp);
}
else
{
ulong[,] temp = MatirxPower(a, n / 2);
return MatirxMultiplication(MatirxMultiplication(temp, temp), a);
}
}
static ulong[,] MatirxMultiplication(ulong[,] a, ulong[,] b)
{
ulong[,] c = new ulong[2, 2];
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < 2; j++)
{
for (int k = 0; k < 2; k++)
{
c[i, j] += a[i, k] * b[k, j];
}
}
}
return c;
}
#endregion
/// <summary>
/// 通项公式法
/// </summary>
/// <param name="n"></param>
/// <returns></returns>
static double F4(int n)
{
double sqrt5 = Math.Sqrt(5);
return (1/sqrt5*(Math.Pow((1+sqrt5)/2,n)-Math.Pow((1-sqrt5)/2,n)));
}
}
}
OK,就这些了。用的long类型来存储结果,当n>92时会内存溢出。
来源:https://www.jianshu.com/p/31b783e3eb46
标签:C#,斐波那契数列
![](/images/zang.png)
![](/images/jiucuo.png)
猜你喜欢
java图片添加水印实例代码分享
2022-06-10 04:06:03
C#中TreeView实现适合两级节点的选中节点方法
2022-10-02 19:12:42
C语言运算符优先级列表(超详细)
2023-07-04 08:17:54
浅谈maven的jar包和war包区别 以及打包方法
2022-07-20 20:14:44
![](https://img.aspxhome.com/file/2023/8/63428_0s.png)
Java JDK与cglib动态代理有什么区别
2023-07-23 08:10:15
Android启动页优化之实现应用秒开
2021-05-27 23:51:32
设置Android系统永不锁屏永不休眠的方法
2021-06-28 12:01:21
java设计模式之适配器模式
2021-08-28 09:08:09
![](https://img.aspxhome.com/file/2023/4/59854_0s.jpg)
c#使用linq把多列的List转化为只有指定列的List
2022-07-04 12:00:31
![](https://img.aspxhome.com/file/2023/2/82112_0s.png)
Android开发之保存图片到相册的三种方法详解
2022-07-26 04:49:10
Spring Boot Admin实践详解
2023-08-25 06:57:53
android采用FFmpeg实现音频混合与拼接剪切
2023-10-04 06:51:24
![](https://img.aspxhome.com/file/2023/4/87274_0s.jpg)
详解C#中的字符串拼接@ $
2021-07-10 13:13:41
浅谈C# 中的委托和事件
2021-06-06 18:53:07
![](https://img.aspxhome.com/file/2023/3/88413_0s.gif)
微信支付仅能成功调用一次问题的解决方法(Android)
2021-07-27 10:40:17
![](https://img.aspxhome.com/file/2023/4/95994_0s.png)
Unity3D实现简易五子棋源码
2021-08-15 15:57:04
Spring Aop 源码增强获取分享
2023-06-22 21:59:22
![](https://img.aspxhome.com/file/2023/5/108415_0s.webp)
在mybatis 中使用if else 进行判断的操作
2021-11-10 23:17:11
高效C#编码优化原则
2023-06-13 03:16:23
利用flutter实现炫酷的list
2022-08-02 01:15:01
![](https://img.aspxhome.com/file/2023/7/138027_0s.gif)