Recursion questions

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));
+    }
+}

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);
+    }
+}

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));
+    }
+}

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);
+
+    }
+}