algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-25 05:22:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: enable ConstantName in checkstyle (#5139)

Browse Source 
Co-authored-by: Maria Paszkiewicz SCC <maria.paszkiewicz@kit.edu>
This commit is contained in:
marysiuniq
2024-05-02 18:31:37 +02:00
committed by GitHub
parent ede3e4651f
commit 1e2d7e9431
16 changed files with 87 additions and 90 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
src/main/java/com/thealgorithms/matrixexponentiation/Fibonacci.java
View File

@ -10,10 +10,10 @@ import java.util.Scanner;
public class Fibonacci {
// Exponentiation matrix for Fibonacci sequence
private static final int[][] fibMatrix = {{1, 1}, {1, 0}};
private static final int[][] identityMatrix = {{1, 0}, {0, 1}};
private static final int[][] FIB_MATRIX = {{1, 1}, {1, 0}};
private static final int[][] IDENTITY_MATRIX = {{1, 0}, {0, 1}};
// First 2 fibonacci numbers
private static final int[][] baseFibNumbers = {{1}, {0}};
private static final int[][] BASE_FIB_NUMBERS = {{1}, {0}};
/**
* Performs multiplication of 2 matrices
@ -53,14 +53,14 @@ public class Fibonacci {
*/
public static int[][] fib(int n) {
if (n == 0) {
return Fibonacci.identityMatrix;
return Fibonacci.IDENTITY_MATRIX;
} else {
int[][] cachedResult = fib(n / 2);
int[][] matrixExpResult = matrixMultiplication(cachedResult, cachedResult);
if (n % 2 == 0) {
return matrixExpResult;
} else {
return matrixMultiplication(Fibonacci.fibMatrix, matrixExpResult);
return matrixMultiplication(Fibonacci.FIB_MATRIX, matrixExpResult);
}
}
}
@ -69,7 +69,7 @@ public class Fibonacci {
// Returns [0, 1, 1, 2, 3, 5 ..] for n = [0, 1, 2, 3, 4, 5.. ]
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[][] result = matrixMultiplication(fib(n), baseFibNumbers);
int[][] result = matrixMultiplication(fib(n), BASE_FIB_NUMBERS);
System.out.println("Fib(" + n + ") = " + result[1][0]);
sc.close();
}