FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java/Maths/Factorial.java at master · rpcwork/Java · GitHub
rpcwork
/
Java
Public
forked from
TheAlgorithms/Java
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Java
/
Maths
/
Factorial.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
34 lines (31 loc) · 933 Bytes
Breadcrumbs
Java
/
Maths
/
Factorial.java
Copy path
File metadata and controls
34 lines (31 loc) · 933 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package
Maths
;
import
java
.
util
.*;
//for importing scanner
public
class
Factorial
{
public
static
void
main
(
String
[]
args
) {
//main method
int
n
=
1
;
Scanner
sc
=
new
Scanner
(
System
.
in
);
System
.
out
.
println
(
"Enter Number"
);
n
=
sc
.
nextInt
();
System
.
out
.
println
(
n
+
"! = "
+
factorial
(
n
));
}
//Factorial = n! = n1 * (n-1) * (n-2)*...1
/**
* Calculate factorial N
*
* @param n the number
* @return the factorial of {@code n}
*/
public
static
long
factorial
(
int
n
) {
// Using recursion
try
{
if
(
n
==
0
) {
return
1
;
// if n = 0, return factorial of n;
}
else
{
return
n
*
factorial
(
n
-
1
);
// While N is greater than 0, call the function again, passing n-1 (Principle of factoring);
}
}
catch
(
ArithmeticException
e
) {
System
.
out
.
println
(
"Dont work with less than 0"
);
}
return
n
;
}
}
Back
|
FazBrowse Home
|
New Git URL