From 016d94fc659da0792a5211c10efbf4bbdde63487 Mon Sep 17 00:00:00 2001 From: Prince Kotadia Date: Fri, 17 Oct 2025 23:06:41 +0530 Subject: [PATCH] Added Optimized solution for computing nth term in fibonacci series --- .../recursion/FibonacciOptimized.java | 23 +++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 src/main/java/com/thealgorithms/recursion/FibonacciOptimized.java diff --git a/src/main/java/com/thealgorithms/recursion/FibonacciOptimized.java b/src/main/java/com/thealgorithms/recursion/FibonacciOptimized.java new file mode 100644 index 000000000000..37c87ebdd40f --- /dev/null +++ b/src/main/java/com/thealgorithms/recursion/FibonacciOptimized.java @@ -0,0 +1,23 @@ +package com.thealgorithms.recursion; + +/* + The Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones, + starting with 0 and 1. + NUMBER 0 1 2 3 4 5 6 7 8 9 10 ... + FIBONACCI 0 1 1 2 3 5 8 13 21 34 55 ... +*/ + +/*T his is optimized solution for fibonacci series. It computes fibonacci series in linear(O(n)) time complexity */ + +public final class FibonacciOptimized { + static int fibonacci(int limit, int num1, int num2){ + if(limit==1){ + return num1; + } + else{ + return fibonacci(limit-1, num2, num1+num2); + } + } + +} +