From a2fe40aee5b47760a190e773dbb70ab68a3ddb69 Mon Sep 17 00:00:00 2001
From: Saksham Tandel <112418122+Saksham14coder@users.noreply.github.com>
Date: Thu, 16 Mar 2023 22:07:05 +0530
Subject: [PATCH] Add recursion questions

---
 Recursion Questions/Fabinocci.java        | 19 +++++++++++++++++
 Recursion Questions/decreasing_order.java | 18 ++++++++++++++++
 Recursion Questions/factorial.java        | 25 +++++++++++++++++++++++
 Recursion Questions/increasing_order.java | 23 +++++++++++++++++++++
 4 files changed, 85 insertions(+)
 create mode 100644 Recursion Questions/Fabinocci.java
 create mode 100644 Recursion Questions/decreasing_order.java
 create mode 100644 Recursion Questions/factorial.java
 create mode 100644 Recursion Questions/increasing_order.java

diff --git a/Recursion Questions/Fabinocci.java b/Recursion Questions/Fabinocci.java
new file mode 100644
index 0000000..8e30ae9
--- /dev/null
+++ b/Recursion Questions/Fabinocci.java	
@@ -0,0 +1,19 @@
+public class Fabinocci {
+
+
+    public static int fabinocci(int n) {
+        if(n==0 || n==1){
+            return n;
+        }
+        int f1 = fabinocci(n-1);
+        int f2 = fabinocci(n-2);
+        int ff = f1+f2;
+        return ff;
+    }
+
+    public static void main(String[] args) {
+        int n = 3;
+       
+        System.out.println( fabinocci(n));
+    }
+}
diff --git a/Recursion Questions/decreasing_order.java b/Recursion Questions/decreasing_order.java
new file mode 100644
index 0000000..0214d2a
--- /dev/null
+++ b/Recursion Questions/decreasing_order.java	
@@ -0,0 +1,18 @@
+ 
+public class decreasing_order {
+
+
+    public static void decreasing(int n) {
+        if(n>=1){
+            System.out.println(n);
+            decreasing(n-1);
+        }
+       
+    }
+
+
+    public static void main(String[] args) {
+        int n =10;
+         decreasing(n);
+    }
+}
diff --git a/Recursion Questions/factorial.java b/Recursion Questions/factorial.java
new file mode 100644
index 0000000..bacf8b0
--- /dev/null
+++ b/Recursion Questions/factorial.java	
@@ -0,0 +1,25 @@
+public class factorial {
+    
+
+    public static int Factorial(int n) {
+        if(n==0){
+            return 1;
+        }
+        int value = n * Factorial(n-1);
+        return value;
+    }
+
+    public static int sum(int n) {
+        if(n==1){
+            return 1;
+        }
+        int value = n + sum(n-1);
+        return value;
+    }
+
+    public static void main(String[] args) {
+        int n = 5;
+        System.out.println(Factorial(n)); 
+        System.out.println(sum(n));
+    }
+}
diff --git a/Recursion Questions/increasing_order.java b/Recursion Questions/increasing_order.java
new file mode 100644
index 0000000..c2b8745
--- /dev/null
+++ b/Recursion Questions/increasing_order.java	
@@ -0,0 +1,23 @@
+import java.util.*; 
+
+public class increasing_order {
+
+
+    public static void increasing(int n) {
+       if(n>=1){
+        increasing(n-1);
+        System.out.println(n);
+         
+       }
+       
+    }
+
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        System.out.println("enter no. to print in increasing order : ");
+        int n = sc.nextInt();
+
+        increasing(n);
+        
+    }
+}