OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update fibonacci_sum.cpp

Browse Source 
changed the matrix addition function for easier readability and added a new test case where n =20 and m =30 to calculate the Fibonacci numbers from the 20th Fibonacci number (F(20)) to the 30th Fibonacci number (F(30)).This test case illustrates the capability of your fiboSum function to handle a more significant range of Fibonacci numbers and provides a meaningful result.
This commit is contained in:
utkarshbhola 2023-10-09 12:27:55 +05:30 committed by GitHub
parent 6376bf46af
commit 5ae4f90029
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 8 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
math/fibonacci_sum.cpp
View File

@ -35,16 +35,12 @@ using matrix = std::vector<std::vector<uint64_t> >;
* @param A martix 2
* @returns resultant matrix
*/
math::fibonacci_sum::matrix multiply(const math::fibonacci_sum::matrix &T,
const math::fibonacci_sum::matrix &A) {
math::fibonacci_sum::matrix result(2, std::vector<uint64_t>(2, 0));
// multiplying matrices
math::fibonacci_sum::matrix multiply(const matrix &T, const matrix &A) {
matrix result(2, std::vector<uint64_t>(2, 0));
result[0][0] = T[0][0] * A[0][0] + T[0][1] * A[1][0];
result[0][1] = T[0][0] * A[0][1] + T[0][1] * A[1][1];
result[1][0] = T[1][0] * A[0][0] + T[1][1] * A[1][0];
result[1][1] = T[1][0] * A[0][1] + T[1][1] * A[1][1];
return result;
}
@ -127,6 +123,12 @@ static void test() {
uint64_t test_5 = math::fibonacci_sum::fiboSum(n, m);
assert(test_5 == 322);
std::cout << "Passed Test 5!" << std::endl;
n=20;
m=30;
uint64_t test_6 = math::fibonacci_sum::fiboSum(n, m);
assert(test_6 == 14328);
std::court << "Passed Test 6!" << std::endl;
}
/**