求素数算法.htm

来自「=== === === === JavaScript经典源代码收集」· HTM 代码 · 共 30 行

<script>
var stopwatch = new Date();
var MaxNum = 100000;
var i, j;
var count = 1;
var PrimeTemp = [];
var PrimeArys = [2];
var oNum = Math.ceil( Math.sqrt( MaxNum ) );
var total = 2;
for(i=3; i<oNum; i+=2)
{
     if( PrimeTemp[ i ]==null)
     {
           for(j=i; i*j<=MaxNum; j+=2)
           {
                 PrimeTemp[ i*j ] = 0;
           }
     }
}
for(i=3; i<=MaxNum; i+=2)
{
	 if( PrimeTemp[ i ]==null)
	 {
		   total+= i;
		   PrimeArys[ count++ ] = i;
	 }
}
document.write( PrimeArys.join(" ") , "<br><br>共" , count, "个<br><br>");
document.write("从1到"+MaxNum+"之间的素数之和是："+total);
</script>