Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
C
Core Java and Java 8
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Lokesh Singh
Core Java and Java 8
Commits
59c4dd06
Unverified
Commit
59c4dd06
authored
Jan 08, 2022
by
Lokesh Singh
Committed by
GitHub
Jan 08, 2022
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Create Find factorial no. of given no.
parent
f0d45297
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
41 additions
and
0 deletions
+41
-0
Find factorial no. of given no.
Find factorial no. of given no.
+41
-0
No files found.
Find factorial no. of given no.
0 → 100644
View file @
59c4dd06
long long int factorial(int N){
//code here
long long int result = 1;
for(int i = 1; i<=N;i++)
{
result*=i;
}
return result;
}
class HelloWorld {
public static void main(String[] args) {
System.out.println("Hello, World!");
//code here
int result = 1;
for(int i = 1; i<=5;i++)
{
result*=i;
}
System.out.println(result);
}
}
//recursive solution for factorial
class HelloWorld {
static int fact(int n)
{
if(n==0)
return 1;
return n*fact(n-1);
}
public static void main(String[] args) {
System.out.println("Hello, World!");
int n = 5;
System.out.println(fact(n));
}
}
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment