﻿<?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-wz5270-随笔分类-algorithms in java</title><link>http://www.blogjava.net/wz5270/category/13590.html</link><description /><language>zh-cn</language><lastBuildDate>Fri, 02 Mar 2007 07:36:15 GMT</lastBuildDate><pubDate>Fri, 02 Mar 2007 07:36:15 GMT</pubDate><ttl>60</ttl><item><title>3.4 埃拉托色尼筛选</title><link>http://www.blogjava.net/wz5270/archive/2006/10/16/75464.html</link><dc:creator>尨奇</dc:creator><author>尨奇</author><pubDate>Mon, 16 Oct 2006 10:51:00 GMT</pubDate><guid>http://www.blogjava.net/wz5270/archive/2006/10/16/75464.html</guid><description><![CDATA[
		<p align="left">质数算法<br />   这个质数算法比较新颖,效率也比较高.<br />class Primes <br />  { <br />    public static void main(String[] args) <br />      { int N = Integer.parseInt(args[0]); <br />        boolean[] a = new boolean[N]; <br />        for (int i = 2; i &lt; N; i++) a[i] = true; <br />        for (int i = 2; i &lt; N; i++) <br />          if (a[i] != false) <br />            for (int j = i; j*i &lt; N; j++) <br />              a[i*j] = false; <br />        for (int i = 2; i &lt; N; i++) <br />          if (i &gt; N - 100) <br />            if (a[i]) Out.print(" " + i); <br />        Out.println(); <br />      } <br />  }<br />  </p>
<img src ="http://www.blogjava.net/wz5270/aggbug/75464.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/wz5270/" target="_blank">尨奇</a> 2006-10-16 18:51 <a href="http://www.blogjava.net/wz5270/archive/2006/10/16/75464.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>3.2 重写Point类</title><link>http://www.blogjava.net/wz5270/archive/2006/07/30/60821.html</link><dc:creator>尨奇</dc:creator><author>尨奇</author><pubDate>Sun, 30 Jul 2006 02:08:00 GMT</pubDate><guid>http://www.blogjava.net/wz5270/archive/2006/07/30/60821.html</guid><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.blogjava.net/wz5270/archive/2006/07/30/60821.html'>阅读全文</a><img src ="http://www.blogjava.net/wz5270/aggbug/60821.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/wz5270/" target="_blank">尨奇</a> 2006-07-30 10:08 <a href="http://www.blogjava.net/wz5270/archive/2006/07/30/60821.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>3.1 方法的定义</title><link>http://www.blogjava.net/wz5270/archive/2006/07/30/60820.html</link><dc:creator>尨奇</dc:creator><author>尨奇</author><pubDate>Sun, 30 Jul 2006 02:02:00 GMT</pubDate><guid>http://www.blogjava.net/wz5270/archive/2006/07/30/60820.html</guid><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.blogjava.net/wz5270/archive/2006/07/30/60820.html'>阅读全文</a><img src ="http://www.blogjava.net/wz5270/aggbug/60820.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/wz5270/" target="_blank">尨奇</a> 2006-07-30 10:02 <a href="http://www.blogjava.net/wz5270/archive/2006/07/30/60820.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>2.1 顺序查找和二分查找</title><link>http://www.blogjava.net/wz5270/archive/2006/07/30/60819.html</link><dc:creator>尨奇</dc:creator><author>尨奇</author><pubDate>Sun, 30 Jul 2006 02:00:00 GMT</pubDate><guid>http://www.blogjava.net/wz5270/archive/2006/07/30/60819.html</guid><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.blogjava.net/wz5270/archive/2006/07/30/60819.html'>阅读全文</a><img src ="http://www.blogjava.net/wz5270/aggbug/60819.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/wz5270/" target="_blank">尨奇</a> 2006-07-30 10:00 <a href="http://www.blogjava.net/wz5270/archive/2006/07/30/60819.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>1.1 快速查找解决连通性问题</title><link>http://www.blogjava.net/wz5270/archive/2006/07/29/60701.html</link><dc:creator>尨奇</dc:creator><author>尨奇</author><pubDate>Sat, 29 Jul 2006 03:42:00 GMT</pubDate><guid>http://www.blogjava.net/wz5270/archive/2006/07/29/60701.html</guid><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.blogjava.net/wz5270/archive/2006/07/29/60701.html'>阅读全文</a><img src ="http://www.blogjava.net/wz5270/aggbug/60701.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/wz5270/" target="_blank">尨奇</a> 2006-07-29 11:42 <a href="http://www.blogjava.net/wz5270/archive/2006/07/29/60701.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>