-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcode 60 1.txt
55 lines (34 loc) · 974 Bytes
/
code 60 1.txt
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
54
55
/*
* Program: recursionex
* Date: 29/5/2019
* Programmer: J.Sookha
* Description:
*/
package recursionex;
import java.util.Scanner;
public class recursionex{
public static void main(String[] args){
/*
4! = 4 * 3 * 2 * 1 = 24
5! = 5 * 4 * 3 * 2 * 1 = 120
*/
int intAnswer;
//Scanner sc = new Scanner(System.in);
//System.out.print("Please enter a number: ");
//int intNum = sc.nextInt();
int intNum = 4;
intAnswer = 1;
for (int intCount = intNum; intCount >= 1; intCount--){
intAnswer = intAnswer * intCount;
}
System.out.println("The answer for " + intNum + "! is - " + intAnswer);
int intOtherAnswer = Factorial(intNum);
System.out.println("The answer for " + intNum + "! is - " + intOtherAnswer);
}
public static int Factorial(int intNumber){
if (intNumber == 0)
return 1;
else
return (intNumber * Factorial(intNumber - 1));
}
}