From 497d48ad876100ec50561555097cf44e5ed16ba0 Mon Sep 17 00:00:00 2001
From: das-amit <91092039+das-amit@users.noreply.github.com>
Date: Sun, 9 Oct 2022 00:00:41 +0530
Subject: [PATCH 1/4] Added fibonacci-recursion.java

---
 .../Java/fibonacci-recursion.java             | 33 +++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 fibonacci_series/Java/fibonacci-recursion.java

diff --git a/fibonacci_series/Java/fibonacci-recursion.java b/fibonacci_series/Java/fibonacci-recursion.java
new file mode 100644
index 0000000..b9f4003
--- /dev/null
+++ b/fibonacci_series/Java/fibonacci-recursion.java
@@ -0,0 +1,33 @@
+import java.util.Scanner;
+
+public class Fibonacci {
+    private static long[] fibonacciCache;
+
+    public static void main(String[] args) {
+
+        Scanner in = new Scanner(System.in);
+        System.out.println("How many terms would you like in the series?:");
+        int numberOfTerms = in.nextInt();
+
+        fibonacciCache = new long[numberOfTerms + 1];
+
+        for (int i = 0; i < numberOfTerms; i++){
+            System.out.println(fibonacci(i) +" ");
+        }
+    }
+
+    private static long fibonacci(int n) {
+        if(n <= 1){
+            return n;
+        }
+
+        if(fibonacciCache[n] != 0){
+            return fibonacciCache[n];
+        }
+
+        long nthFibonacciNumber = (fibonacci(n - 1) + fibonacci(n - 2));
+        fibonacciCache[n] = nthFibonacciNumber;
+
+        return nthFibonacciNumber;
+    }
+}

From edd86aae6a12baaf80dc9d70ca29085ea740a93f Mon Sep 17 00:00:00 2001
From: das-amit <91092039+das-amit@users.noreply.github.com>
Date: Mon, 10 Oct 2022 01:34:52 +0530
Subject: [PATCH 2/4] Edited the existing Code

---
 fibonacci_series/Java/fibonacci-recursion.java | 10 +---------
 1 file changed, 1 insertion(+), 9 deletions(-)

diff --git a/fibonacci_series/Java/fibonacci-recursion.java b/fibonacci_series/Java/fibonacci-recursion.java
index b9f4003..02f97bc 100644
--- a/fibonacci_series/Java/fibonacci-recursion.java
+++ b/fibonacci_series/Java/fibonacci-recursion.java
@@ -1,33 +1,25 @@
 import java.util.Scanner;
-
 public class Fibonacci {
     private static long[] fibonacciCache;
-
     public static void main(String[] args) {
-
         Scanner in = new Scanner(System.in);
         System.out.println("How many terms would you like in the series?:");
         int numberOfTerms = in.nextInt();
-
         fibonacciCache = new long[numberOfTerms + 1];
-
         for (int i = 0; i < numberOfTerms; i++){
             System.out.println(fibonacci(i) +" ");
         }
+      in.close();
     }
-
     private static long fibonacci(int n) {
         if(n <= 1){
             return n;
         }
-
         if(fibonacciCache[n] != 0){
             return fibonacciCache[n];
         }
-
         long nthFibonacciNumber = (fibonacci(n - 1) + fibonacci(n - 2));
         fibonacciCache[n] = nthFibonacciNumber;
-
         return nthFibonacciNumber;
     }
 }

From 5fdefb8e68ef578f0a971752083030d51a89ee20 Mon Sep 17 00:00:00 2001
From: das-amit <91092039+das-amit@users.noreply.github.com>
Date: Mon, 10 Oct 2022 02:17:30 +0530
Subject: [PATCH 3/4] Deleted the unmerged file

---
 .../Java/fibonacci-recursion.java             | 25 -------------------
 1 file changed, 25 deletions(-)
 delete mode 100644 fibonacci_series/Java/fibonacci-recursion.java

diff --git a/fibonacci_series/Java/fibonacci-recursion.java b/fibonacci_series/Java/fibonacci-recursion.java
deleted file mode 100644
index 02f97bc..0000000
--- a/fibonacci_series/Java/fibonacci-recursion.java
+++ /dev/null
@@ -1,25 +0,0 @@
-import java.util.Scanner;
-public class Fibonacci {
-    private static long[] fibonacciCache;
-    public static void main(String[] args) {
-        Scanner in = new Scanner(System.in);
-        System.out.println("How many terms would you like in the series?:");
-        int numberOfTerms = in.nextInt();
-        fibonacciCache = new long[numberOfTerms + 1];
-        for (int i = 0; i < numberOfTerms; i++){
-            System.out.println(fibonacci(i) +" ");
-        }
-      in.close();
-    }
-    private static long fibonacci(int n) {
-        if(n <= 1){
-            return n;
-        }
-        if(fibonacciCache[n] != 0){
-            return fibonacciCache[n];
-        }
-        long nthFibonacciNumber = (fibonacci(n - 1) + fibonacci(n - 2));
-        fibonacciCache[n] = nthFibonacciNumber;
-        return nthFibonacciNumber;
-    }
-}

From e8252a680d23eac3340bd75be4bd5f9b1b96b6f3 Mon Sep 17 00:00:00 2001
From: das-amit <91092039+das-amit@users.noreply.github.com>
Date: Mon, 10 Oct 2022 02:18:46 +0530
Subject: [PATCH 4/4] Added the Java Fibonacci solution using recursion

---
 fibonacci_series/Java/FibonacciRecursion.java | 25 +++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 fibonacci_series/Java/FibonacciRecursion.java

diff --git a/fibonacci_series/Java/FibonacciRecursion.java b/fibonacci_series/Java/FibonacciRecursion.java
new file mode 100644
index 0000000..1d331df
--- /dev/null
+++ b/fibonacci_series/Java/FibonacciRecursion.java
@@ -0,0 +1,25 @@
+import java.util.Scanner;
+public class FibonacciRecursion {
+    private static long[] fibonacciCache;
+    public static void main(String[] args) {
+        Scanner in = new Scanner(System.in);
+        System.out.println("How many terms would you like in the series?:");
+        int numberOfTerms = in.nextInt();
+        fibonacciCache = new long[numberOfTerms + 1];
+        for (int i = 0; i < numberOfTerms; i++){
+            System.out.println(fibonacci(i) +" ");
+        }
+      in.close();
+    }
+    private static long fibonacci(int n) {
+        if(n <= 1){
+            return n;
+        }
+        if(fibonacciCache[n] != 0){
+            return fibonacciCache[n];
+        }
+        long nthFibonacciNumber = (fibonacci(n - 1) + fibonacci(n - 2));
+        fibonacciCache[n] = nthFibonacciNumber;
+        return nthFibonacciNumber;
+    }
+}