計算斐波那契數列的演算法

peizhang發表於2018-10-05
演算法
// 計算斐波那契數列第n項  1 1 2 3 5 8 13 21
long fi(int n)
{
    long result = 1;
    long previous = 1;
    long pprevious = 1;

    while (n > 2)
   {
    n--;
    pprevious = previous;
    previous = result;
    result = previous + pprevious;
   }
   return result;
}

相關文章