﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>BlogJava-xan walking &amp; thinking-最新评论</title><link>http://www.blogjava.net/xan/CommentsRSS.aspx</link><description>学习 思考 实践</description><language>zh-cn</language><pubDate>Mon, 02 Feb 2009 04:56:15 GMT</pubDate><lastBuildDate>Mon, 02 Feb 2009 04:56:15 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 一个求素数的算法（不懂）</title><link>http://www.blogjava.net/xan/archive/2008/05/08/198460.html#199229</link><dc:creator>xan</dc:creator><author>xan</author><pubDate>Thu, 08 May 2008 06:10:00 GMT</pubDate><guid>http://www.blogjava.net/xan/archive/2008/05/08/198460.html#199229</guid><description><![CDATA[@郑晖<br>$arr[] 数组存储的是小于number的素数集合<br>return false  if  number  %  $arr[j] ==0    $arr[j] 是小于number的某一个素数<br>这就是我搞不懂的，实际上，我们熟知的判断素数方法是：<br>for(i=0; i&lt;sqrt(number); i++)  // 或者 i*i &lt; number<br>{<br>    if(number%i == 0) return false;<br>}<br>return true;<br><br>你说的是这个吧<br><img src ="http://www.blogjava.net/xan/aggbug/199229.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/xan/" target="_blank">xan</a> 2008-05-08 14:10 <a href="http://www.blogjava.net/xan/archive/2008/05/08/198460.html#199229#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 一个求素数的算法（不懂）</title><link>http://www.blogjava.net/xan/archive/2008/05/08/198460.html#199202</link><dc:creator>郑晖</dc:creator><author>郑晖</author><pubDate>Thu, 08 May 2008 04:17:00 GMT</pubDate><guid>http://www.blogjava.net/xan/archive/2008/05/08/198460.html#199202</guid><description><![CDATA[while  $arr[j] * $arr[j] &lt;=number   （若number有一大于其平方根的因子，则必有小于其平方根的因子，在此之前必已返回false。故此当$arr[j] * $arr[j] &gt;number时循环即可中止 ）<br><br>return false  if  number  %  $arr[j] ==0（如果number能被arr[j]整除，当然不是素数，故返回false）<img src ="http://www.blogjava.net/xan/aggbug/199202.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/xan/" target="_blank">郑晖</a> 2008-05-08 12:17 <a href="http://www.blogjava.net/xan/archive/2008/05/08/198460.html#199202#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>