-
Notifications
You must be signed in to change notification settings - Fork 1k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #11 from TesseractCoding/master
mpr
- Loading branch information
Showing
5 changed files
with
77 additions
and
2 deletions.
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
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
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
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,29 @@ | ||
| // check whether a number is Prime or not without recursion | ||
|
|
||
| import java.util.Scanner; | ||
| class Prime | ||
| { | ||
| public static void main(String args[]) | ||
| { | ||
| Scanner sc=new Scanner(System.in); | ||
| System.out.print("Enter a number : "); | ||
| int n=(int)Math.abs(sc.nextInt()); | ||
| int c=0; | ||
| for(int i=2;i<n;i++) | ||
| if (n%i==0) | ||
| c++; | ||
| System.out.println(n+((c==0)?" is a Prime Number." :" is not a Prime Number.")); | ||
| } | ||
| } | ||
|
|
||
| // Contributed By ErzaTitani-2001 | ||
|
|
||
| /* | ||
| Sample Input and Output : | ||
| Input : | ||
| Enter a number : 13 | ||
| Output : | ||
| 13 is a Prime Number. | ||
| Space Complexity : O(1) | ||
| Time Complexity : O(n) | ||
| */ |
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,36 @@ | ||
| // check whether a number is Prime or not with recursion | ||
|
|
||
| import java.util.Scanner; | ||
| class PrimeRecursion | ||
| { | ||
| public static int prime(int n,int div) | ||
| { | ||
| if(div<n) | ||
| { if(n%div!=0) | ||
| prime(n,div+1); | ||
| else | ||
| return 0; | ||
| } | ||
| return 1; | ||
| } | ||
| public static void main(String args[]) | ||
| { | ||
| Scanner sc=new Scanner(System.in); | ||
| System.out.print("Enter a number : "); | ||
| int n=(int)Math.abs(sc.nextInt()); | ||
| int c=prime(n,2); | ||
| System.out.println(n+((c!=0)?" is a Prime Number." :" is not a Prime Number.")); | ||
| } | ||
| } | ||
|
|
||
| // Contributed By ErzaTitani-2001 | ||
|
|
||
| /* | ||
| Sample Input and Output : | ||
| Input : | ||
| Enter a number : 13 | ||
| Output : | ||
| 13 is a Prime Number. | ||
| Space Complexity : O(n) | ||
| Time Complexity : O(n) | ||
| */ |