计算一百万个素数(to calculate one million prime numbers)

 我有一个问题要打印一百万个素数。 我已经写了一个Java程序..它目前需要约1.5分钟来计算它..我认为我的解决方案不是那么高效。 我使用了下面的算法： 
 
 
 
 首先将1 2 3添加到主要列表中 
 
 
 计算要检查的号码的最后一位数字 
 
 
 检查数字是0,2或4还是6或8，然后跳过数字 
 
 
 否则计算数字的平方根。 
 
 
 尝试将数字从2开始划分，直到数字的平方根 
 
 
 如果数字是可整除的，则跳过数字，然后将其添加到素数列表中 
 
 
 我也读过其他几种解决方案，但我没有找到一个好的答案。 请理想地建议应该是什么应该是大约最短的时间来计算这个和需要做出什么样的改变，使算法更有效率。 

I have got one question to print one million prime numbers . I have written a java program for that .. It's currently taking 1.5 mins approx to calculate it .. I think my solution is not that efficient. I have used the below algo:
 
 
 
Adding 1 2 3 to the prime list initially 
 
 
Calculating the last digit of the number to be checked 
 
 
Checking if the digit is 0 , 2 or 4 or 6 or 8 then skipping the number
 
 
else calculating the square root of the number .. 
 
 
Trying to Divide the number starting from 2 till the square root of the number 
 
 
if number is divisible then skipping the number else adding it to the prime list 
 
 
I have read several other solutions as well , but I didn't find a good answer. Please suggest ideally what should be approx minimum time to calculate this and what changes are required to make the algorithm more efficient.

原文：https://stackoverflow.com/questions/13404389