We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 016d94f commit 198277fCopy full SHA for 198277f
1 file changed
src/main/java/com/thealgorithms/recursion/FibonacciOptimized.java
@@ -7,17 +7,18 @@
7
FIBONACCI 0 1 1 2 3 5 8 13 21 34 55 ...
8
*/
9
10
-/*T his is optimized solution for fibonacci series. It computes fibonacci series in linear(O(n)) time complexity */
11
-
+/* This is optimized solution for fibonacci series. It computes fibonacci series in linear (O(n)) time complexity */
12
public final class FibonacciOptimized {
13
- static int fibonacci(int limit, int num1, int num2){
14
- if(limit==1){
+
+ private FibonacciOptimized() {
+ // Prevent instantiation
15
+ }
16
17
+ static int fibonacci(int limit, int num1, int num2) {
18
+ if (limit == 1) {
19
return num1;
- }
- else{
- return fibonacci(limit-1, num2, num1+num2);
20
+ } else {
21
+ return fibonacci(limit - 1, num2, num1 + num2);
22
}
23
-}
24
+}
0 commit comments