斐波那契数列,递归算法 C#

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Fibonacci
{
class Program
{
/// <summary>
/// 斐波那契数列,递归算法
/// </summary>
/// <param name="args"></param>
static void Main(string[] args)
{
int num;
Console.Write("请输入你需要计算的位数：");
num = int.Parse(Console.ReadLine());
Console.WriteLine("第" + num + "位的数为：" + FbnqSort(num));
Console.ReadKey();
}

public static int FbnqSort(int n)
{
if (n <= 0)
return 0;
else if (n > 0 && n <= 2)
return 1;
else
return FbnqSort(n - 1) + FbnqSort(n - 2);
}
}
}