Created
April 28, 2021 17:25
-
-
Save BT-ICD/f19dd2d27d057701961ea332a49f0650 to your computer and use it in GitHub Desktop.
Recursion - Function to find factorial using recursion
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* Example: To learn about recursion - | |
* Function to factorial using recursion | |
* **/ | |
public class FactorialWithRecursion { | |
public static void main(String[] args) { | |
int num = 4; | |
int ans = factorial(num); | |
System.out.println("Factorial of " + num + " is " + ans); | |
} | |
public static int factorial(int n){ | |
if(n==1) | |
return 1; | |
return n * factorial(n-1); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Sample output
Factorial of 4 is 24