Recursion method to find factorial

ShivamShah410 · web-flow · commit 37f35ff93a83 · 2020-10-01T14:38:29.000+05:30
diff --git a/factorial.java b/factorial.java
@@ -1,16 +1,18 @@
 import java.util.*;
-public class factorial{
+public class factorial
+{
+ public static int fact(int i)
+ {
+   if(i==1)
+     return 1;
+   else
+     return i*fact(i-1);
+ }
 
  public static void main(String args[])
  {
- Scanner s=new Scanner(System.in);
- int n=s.nextInt();
- long f=1;
-
-  for(int i=1;i<=n;i++)
-    f=f*i;
-    System.out.println(f);
-
+   Scanner s=new Scanner(System.in);
+   int n=s.nextInt();
+   System.out.println(fact(n));
  }
-
 }
