JavaScript implementation find prime code to share
- 2020-05-17 04:48:47
- OfStack
Well, no background notes, no advanced skills, just plain boring, trying to find all the prime Numbers in 10,000. So here we go:
function zhishu(num) {
if (num == 1) {
return false;
}
if (num == 2) {
return true;
}
for (var i = 2; i <= Math.sqrt(num); i++) {
if (num % i == 0) {
return false;
}
}
return true;
}
Examples of use:
var zhishuArray = [];
for (var j = 1; j < 100000; j++) {
if (zhishu(j)) {
zhishuArray.push(j);
}
}
console.dir(zhishuArray);