First 100 prime numbers - Java
public class First100Prime {
public void printFirst100Prime(){
for(int i=1; i<=100; i++){
boolean isPrime = true;
for(int j=2; j<i; j++){
if(i%j == 0){
isPrime = false;
break;
}
}
if(isPrime)
System.out.println(i);
}
}
}
package ds.numbers;
import org.junit.Test;
import static org.junit.Assert.*;
public class First100PrimeTest {
@Test
public void testPrintFirst100Prime() throws Exception {
First100Prime first100Prime = new First100Prime();
first100Prime.printFirst100Prime();
}
}
----------------------------------------------
github link:
https://github.com/sujjjith/DS/blob/master/src/main/java/ds/numbers/First100Prime.java
https://github.com/sujjjith/DS/blob/master/src/test/java/ds/numbers/First100PrimeTest.java
public void printFirst100Prime(){
for(int i=1; i<=100; i++){
boolean isPrime = true;
for(int j=2; j<i; j++){
if(i%j == 0){
isPrime = false;
break;
}
}
if(isPrime)
System.out.println(i);
}
}
}
-----------------------------------
import org.junit.Test;
import static org.junit.Assert.*;
public class First100PrimeTest {
@Test
public void testPrintFirst100Prime() throws Exception {
First100Prime first100Prime = new First100Prime();
first100Prime.printFirst100Prime();
}
}
----------------------------------------------
github link:
https://github.com/sujjjith/DS/blob/master/src/main/java/ds/numbers/First100Prime.java
https://github.com/sujjjith/DS/blob/master/src/test/java/ds/numbers/First100PrimeTest.java
Comments
Post a Comment