factorial using recursion

binodcoder · binodcoder · commit ee60ff2e485c · 2024-05-24T15:44:05.000+01:00
diff --git a/src/binod/RecursionFactorial.java b/src/binod/RecursionFactorial.java
@@ -0,0 +1,19 @@
+package binod;
+import java.util.Scanner;
+public class RecursionFactorial {
+    //Q. Find the factorial of n number
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        System.out.println("Enter n number");
+        int n = scanner.nextInt();
+        printFactorial(n, 1);
+    }
+    public static void printFactorial(int n, int fac) {
+        if(n==1){
+            System.out.println(fac);
+            return;
+        }
+        fac*=n;
+        printFactorial(n-1, fac);
+    }
+}
