//利用矩阵求解fibonacci数列
#include <cassert>
#include <stdio.h>
///
// A 2 by 2 matrix
///
struct Matrix2By2
{
Matrix2By2
(
long int m00 = 0,
long int m01 = 0,
long int m10 = 0,
long int m11 = 0
)
:m_00(m00), m_01(m01), m_10(m10), m_11(m11)
{
}
long int m_00;
long int m_01;
long int m_10;
long int m_11;
};
///
// Multiply two matrices
// Input: matrix1 - the first matrix
// matrix2 - the second matrix
//Output: the production of two matrices
///
Matrix2By2 MatrixMultiply
(
const Matrix2By2& matrix1,
const Matrix2By2& matrix2
)
{
return Matrix2By2(
matrix1.m_00 * matrix2.m_00 + matrix1.m_01 * matrix2.m_10,
matrix1.m_00 * matrix2.m_01 + matrix1.m_01 * matrix2.m_11,
matrix1.m_10 * matrix2.m_00 + matrix1.m_11 * matrix2.m_10,
matrix1.m_10 * matrix2.m_01 + matrix1.m_11 * matrix2.m_11);
}
///
// The nth power of matrix
// 1 1
// 1 0
///
Matrix2By2 MatrixPower(unsigned int n)
{
assert(n > 0);
Matrix2By2 matrix;
if(n == 1)
{
matrix = Matrix2By2(1, 1, 1, 0);
}
else if(n % 2 == 0)
{
matrix = MatrixPower(n / 2);
matrix = MatrixMultiply(matrix, matrix);
}
else if(n % 2 == 1)
{
matrix = MatrixPower((n - 1) / 2);
matrix = MatrixMultiply(matrix, matrix);
matrix = MatrixMultiply(matrix, Matrix2By2(1, 1, 1, 0));
}
return matrix;
}
///
// Calculate the nth item of Fibonacci Series using devide and conquer
///
long int Fibonacci_Solution3(unsigned int n)
{
int result[2] = {0, 1};
if(n < 2)
return result[n];
Matrix2By2 PowerNMinus2 = MatrixPower(n - 1);
return PowerNMinus2.m_00;
}
int main()
{
int n;
long int result;
printf("Please input a number:");
scanf("%d",&n);
result=Fibonacci_Solution3(n);
printf("%ld\n",result);
}
利用矩阵求解fibonacci数列 时间复杂度为O(lgn)
最新推荐文章于 2022-10-23 19:08:49 发布