From 5f78fb3cf163d4e70ad37913aeb783224189d627 Mon Sep 17 00:00:00 2001
From: Rishabh Singh <54681928+Rishi098@users.noreply.github.com>
Date: Sat, 2 Oct 2021 17:54:24 +0530
Subject: [PATCH] Add Fibonacci Series Using Recursion in Java

Here i have added java file for Fibonacci Series Using Recursion Method
i will help to understand how a recursion function will work for find nth term of Fibonacci Series
Program Logic:

A recursive function is one that has the capability to call itself.

fibonacciRecursion():

The Java Fibonacci recursion function takes an input number. Checks for 0, 1, 2 and returns 0, 1, 1 accordingly because Fibonacci sequence in Java starts with 0, 1, 1.
When input n is >=3, The function will call itself recursively. The call is done two times.
---
 Programs/FibonacciCalc.java | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 Programs/FibonacciCalc.java

diff --git a/Programs/FibonacciCalc.java b/Programs/FibonacciCalc.java
new file mode 100644
index 0000000..46cd166
--- /dev/null
+++ b/Programs/FibonacciCalc.java
@@ -0,0 +1,19 @@
+//Using Recursion
+public class FibonacciCalc{
+	public static int fibonacciRecursion(int n){
+	if(n == 0){
+		return 0;
+	}
+	if(n == 1 || n == 2){
+			return 1;
+		}
+	return fibonacciRecursion(n-2) + fibonacciRecursion(n-1);
+	}
+    public static void main(String args[]) {
+	int maxNumber = 10;
+	System.out.print("Fibonacci Series of "+maxNumber+" numbers: ");
+	for(int i = 0; i < maxNumber; i++){
+			System.out.print(fibonacciRecursion(i) +" ");
+		}
+	}
+}