iSharkFly-Docs
/
java-tutorials
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Finish prime number test to check prime number too 100

This commit is contained in:
YuCheng Hu 2021-04-28 23:38:57 -04:00
parent ec09d5dfdd
commit 5e5b69c9d2
1 changed files with 8 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
toolkits/codebank/src/test/java/com/ossez/toolkits/codebank/tests/algorithm/PrimeNumbersTest.java
View File

@ -1,6 +1,5 @@
package com.ossez.toolkits.codebank.tests.algorithm; package com.ossez.toolkits.codebank.tests.algorithm;
import org.junit.jupiter.api.Test; import org.junit.jupiter.api.Test;
import org.junit.jupiter.api.TestInstance; import org.junit.jupiter.api.TestInstance;
import org.slf4j.Logger; import org.slf4j.Logger;
@ -11,9 +10,9 @@ import java.util.List;
/** /**
* <p> * <p>
* More details about question see link below * Prime numbers from 1 to 100
* <ul> * <ul>
* <li>@see <a href= "https://www.cwiki.us/display/ITCLASSIFICATION/Binary+Gap">https://www.cwiki.us/display/ITCLASSIFICATION/Binary+Gap</a> * <li>@see <a href= "https://www.ossez.com/t/prime-numbers-from-1-to-100-100/13450">https://www.ossez.com/t/prime-numbers-from-1-to-100-100/13450</a>
* </li> * </li>
* </ul> * </ul>
* </p> * </p>
@ -34,21 +33,21 @@ public class PrimeNumbersTest {
int N = 100; int N = 100;
List<Integer> primeNumberList = new ArrayList<>(); List<Integer> primeNumberList = new ArrayList<>();
for (int i = 2; i < N; i++) { for (int i = 2; i < N; i++) {
if (isPrimeNumber(i)) if (isPrimeNumber(i))
primeNumberList.add(i); primeNumberList.add(i);
} }
logger.debug("primeNumber Count -[{}]", primeNumberList.size()); logger.debug("primeNumber Count -[{}]", primeNumberList.size());
logger.debug("primeNumber Count -[{}]", primeNumberList); logger.debug("primeNumber Count -[{}]", primeNumberList);
} }
/** /**
* @param number * @param number
* @return * @return
*/ */
public boolean isPrimeNumber(int number) { private boolean isPrimeNumber(int number) {
System.out.println(5%3);;
for (int i = 2; i < number; i++) { for (int i = 2; i < number; i++) {
if (number % i == 0) { if (number % i == 0) {
return false; return false;