This repository has been archived by the owner on Oct 14, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 249
Factorial of a number #529
Open
riyatyag-6
wants to merge
3
commits into
aditya109:master
Choose a base branch
from
riyatyag-6:master
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Changes from 2 commits
Commits
Show all changes
3 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,37 @@ | ||
#include <iostream> | ||
using namespace std; | ||
//Insertion sort | ||
int main(){ | ||
|
||
int n,comp=0,swap=0; | ||
cout<<"Enter the no. of elements: "; | ||
cin>>n; | ||
|
||
|
||
int arr[n]; | ||
cout<<"Enter the unsorted array: "; | ||
for(int i=0;i<n;i++){ | ||
cin>>arr[i]; | ||
} | ||
|
||
for(int i=1;i<n;i++){ | ||
int current=arr[i]; | ||
int j=i-1; | ||
while(arr[j]>current && j>=0){ | ||
arr[j+1]=arr[j]; | ||
j--; | ||
comp++; | ||
} | ||
arr[j+1]=current; | ||
swap++; | ||
} | ||
|
||
cout<<"Yor sorted array: ["; | ||
for(int i=0;i<n;i++){ | ||
cout<<arr[i]<<" "; | ||
} | ||
cout<<"]"; | ||
|
||
|
||
|
||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,22 @@ | ||
import java.util.*; | ||
public class Factorial { | ||
public static void main(String[] args){ | ||
int num; | ||
System.out.println("Enter the number to get factorial: "); | ||
Scanner reader= new Scanner(System.in); | ||
num=reader.nextInt(); | ||
int factorial=1; | ||
if(num>0) { | ||
for(int i=1;i<=num;i++){ | ||
factorial*=i; | ||
} | ||
System.out.println("Factorial of "+num+" is "+factorial); | ||
} | ||
else if(num<0){ | ||
System.out.println("Not Defined "); | ||
} | ||
else{ | ||
System.out.println(" factorial is 0 "); | ||
} | ||
} | ||
} |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Create a few folder like
InsertionSort
inside the C++ directory and then place theInsertionsort.cpp
file inside of it.