algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-24 21:14:00 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: update the whole repository

Browse Source 
* fix some bugs
* delete duplicate files
* format code
This commit is contained in:
yanglbme
2019-05-09 19:32:54 +08:00
parent 163db8521a
commit 29948363da
368 changed files with 4372 additions and 30841 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
Others/SieveOfEratosthenes.java
View File

@ -1,7 +1,7 @@
package Others;
/**
*
* @author Varun Upadhyay (https://github.com/varunu28)
*
*/
public class SieveOfEratosthenes {
@ -9,27 +9,27 @@ public class SieveOfEratosthenes {
* This method implements the Sieve of Eratosthenes Algorithm
*
* @param n The number till which we have to check for prime
* Prints all the prime numbers till n
* Prints all the prime numbers till n
**/
public static void findPrimesTillN(int n) {
int[] arr = new int[n+1];
int[] arr = new int[n + 1];
for (int i=0;i<=n;i++) {
for (int i = 0; i <= n; i++) {
arr[i] = 1;
}
arr[0] = arr[1] = 0;
for (int i=2;i<=Math.sqrt(n);i++) {
for (int i = 2; i <= Math.sqrt(n); i++) {
if (arr[i] == 1) {
for (int j=2;i*j <= n;j++) {
arr[i*j] = 0;
for (int j = 2; i * j <= n; j++) {
arr[i * j] = 0;
}
}
}
for (int i=0;i<n+1;i++) {
for (int i = 0; i < n + 1; i++) {
if (arr[i] == 1) {
System.out.print(i + " ");
}