-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDay9-Recursion-3
More file actions
53 lines (37 loc) · 1.36 KB
/
Copy pathDay9-Recursion-3
File metadata and controls
53 lines (37 loc) · 1.36 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
Problem:
Objective
Today, we're learning and practicing an algorithmic concept called Recursion. Check out the Tutorial tab for learning materials and an instructional video!
Recursive Method for Calculating Factorial:
factotial(N) = {1 N<= 1
N x factorial(N-1) otherwise
Task
Write a factorial function that takes a positive integer, N as a parameter and prints the result of N!(N factorial).
Solution:
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
// Complete the factorial function below.
static int factorial(int n) {
int fact = 1;
for(int i=1;i<=n;i++){
fact = fact*i;
}
return fact;
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int n = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int result = factorial(n);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}