C++博客-RePorridge-随笔分类-日常笔记http://www.cppblog.com/JaceForce/category/20696.htmlNothing change but our heartzh-cnSun, 15 May 2016 01:24:40 GMTSun, 15 May 2016 01:24:40 GMT60Everyone is selfishhttp://www.cppblog.com/JaceForce/archive/2016/03/25/213111.htmlPorridgePorridgeFri, 25 Mar 2016 02:25:00 GMThttp://www.cppblog.com/JaceForce/archive/2016/03/25/213111.htmlhttp://www.cppblog.com/JaceForce/comments/213111.htmlhttp://www.cppblog.com/JaceForce/archive/2016/03/25/213111.html#Feedback0http://www.cppblog.com/JaceForce/comments/commentRss/213111.htmlhttp://www.cppblog.com/JaceForce/services/trackbacks/213111.html

Porridge 2016-03-25 10:25 发表评论
]]>时间复杂度O(n)筛素数(质数)http://www.cppblog.com/JaceForce/archive/2013/10/06/203556.htmlPorridgePorridgeSun, 06 Oct 2013 13:43:00 GMThttp://www.cppblog.com/JaceForce/archive/2013/10/06/203556.htmlhttp://www.cppblog.com/JaceForce/comments/203556.htmlhttp://www.cppblog.com/JaceForce/archive/2013/10/06/203556.html#Feedback0http://www.cppblog.com/JaceForce/comments/commentRss/203556.htmlhttp://www.cppblog.com/JaceForce/services/trackbacks/203556.html除了素数之外的数就是合数：合数可以由多个素数相乘得如 A = p1^n1 * p2 ^ n3 * p3^n3 ……

我们预先把所有的大于等于2的数都标记为素数。
这样我们就可以想到先找到第一个素数2则，4，6，8，10……就都不是素数了。
下面是实现的方法。别人那里学来的。
--------------------------------------------------------------------------------------------
2016-5-11修改代码 for循环不能用<=越界访问
Onprime


Porridge 2013-10-06 21:43 发表评论
]]>