-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFactorial.java
49 lines (27 loc) · 963 Bytes
/
Factorial.java
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
package tomkous.algos;
import java.util.Scanner;
public class Factorial {
public static int findFactorial(int number){
int resNumber=number;
for(int i = number-1; i > 1; i--){
resNumber = resNumber * i;
System.out.println(resNumber);
}
return resNumber;
}
public static int findFactorialRecursive(int number){
int resNumber=number;
number -= 1;
if (number > 1)
System.out.println(resNumber);
resNumber = resNumber * findFactorialRecursive(number);
return resNumber;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("please enter a number");
int nmbr = Integer.valueOf(sc.nextLine());
System.out.println("iteration " + findFactorial(nmbr));
System.out.println("recursion " + findFactorialRecursive(nmbr));
}
}