<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>多难兴邦</title><link /><description>人这一生,什么都可以丢,但有两样东西决不能丢,那就是: 良心和理想!</description><dc:language>zh-CN</dc:language><lastUpdateTime>Sun, 15 Jun 2008 19:45:41 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>东子</dc:creator><title>排序算法之归并排序算法和基数排序算法</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550618.aspx</link><pubDate>Sun, 15 Jun 2008 19:46:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550618.aspx</guid><wfw:comment>comments/2550618.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550618.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2550618.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2550618</trackback:ping><description>归并排序算法有：2-路归并排序算法；
基数排序算法有：多关键字排序算法、链式基数排序算法；&lt;img src ="aggbug/2550618.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>排序算法之选择排序算法</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550601.aspx</link><pubDate>Sun, 15 Jun 2008 19:42:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550601.aspx</guid><wfw:comment>comments/2550601.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550601.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2550601.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2550601</trackback:ping><description>选择排序有：简单选择排序算法，树形选择排序算法，堆排序算法
&lt;img src ="aggbug/2550601.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>排序算法之交换排序算法</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550595.aspx</link><pubDate>Sun, 15 Jun 2008 19:40:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550595.aspx</guid><wfw:comment>comments/2550595.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550595.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2550595.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2550595</trackback:ping><description>交换排序有冒泡排序算法，快速排序算法&lt;img src ="aggbug/2550595.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>排序算法之插入排序算法</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550588.aspx</link><pubDate>Sun, 15 Jun 2008 19:37:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550588.aspx</guid><wfw:comment>comments/2550588.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550588.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2550588.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2550588</trackback:ping><description>插入排序算法大致有：直接插入排序算法,折半插入排序算法,2-路插入排序算法,表插入排序算法,希尔排序算法



&lt;img src ="aggbug/2550588.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>排序算法总结</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550564.aspx</link><pubDate>Sun, 15 Jun 2008 19:32:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550564.aspx</guid><wfw:comment>comments/2550564.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/15/2550564.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2550564.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2550564</trackback:ping><description>在考虑用哪种算法时，算法的应用环境是应该用哪种算法的决定的因素。没用一种算法是万能算法。每种算法都有它的优点和缺点，在应用时需要根据具体的环境来选择。按排序过程中依据的不同原则对内部排序方法进行分类，大致可分为插入排序、交换排序、选择排序、归并排序、计数排序。接下来将逐一介绍每一种算法&lt;img src ="aggbug/2550564.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>Java Collections Framework比较</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/09/2527790.aspx</link><pubDate>Mon, 09 Jun 2008 18:36:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/09/2527790.aspx</guid><wfw:comment>comments/2527790.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/06/09/2527790.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2527790.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2527790</trackback:ping><description> Java Collections Framework成员主要包括两种类型，即：Collection和Map类型。 在Java中提供了Collection和Map接口。其中List和Set继承了Collection接口；同时用Vector、ArrayList、LinkedList三个类实现List接口，HashSet、TreeSet实现Set接口。直接有HashTable、HashMap、TreeMap实现Map接口。由此可见，Java中用8种类型的基本数据结构来实现其Collections Framework；下面分别进行介绍。       &lt;img src ="aggbug/2527790.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>关于java修饰符transient 和 volatile</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/02/15/2097309.aspx</link><pubDate>Fri, 15 Feb 2008 16:08:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/02/15/2097309.aspx</guid><wfw:comment>comments/2097309.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2008/02/15/2097309.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2097309.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2097309</trackback:ping><description>java 中的 transient 修饰符和 volatile修饰符的意义:

首先,  被transient 修饰符修饰的变量, 表明其值不会被写入存储区域.

其次,  被volatile修饰符修饰的变量, 表示其值在程序中可以发生变化,一般被应用于多线程的情况.  在多线程的情况下,每个线程都改变volatile变量的主副本
&lt;img src ="aggbug/2097309.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>清华给美国培养工程师，北大给美国培养老婆?(转载)</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/12/17/1943586.aspx</link><pubDate>Mon, 17 Dec 2007 13:47:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/12/17/1943586.aspx</guid><wfw:comment>comments/1943586.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/12/17/1943586.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/1943586.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1943586</trackback:ping><description>清华给美国培养工程师，北大给美国培养老婆&lt;img src ="aggbug/1943586.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>驻伊美军阵亡人数与中国煤矿矿难死亡人数，一直按1：7的比例产生</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/12/03/1913624.aspx</link><pubDate>Mon, 03 Dec 2007 13:12:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/12/03/1913624.aspx</guid><wfw:comment>comments/1913624.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/12/03/1913624.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/1913624.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1913624</trackback:ping><description>驻伊美军阵亡人数与中国煤矿矿难死亡人数，一直按1：7的比例产生&lt;img src ="aggbug/1913624.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>用SimpleDateFormat类,格式化日期和时间模式</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/29/1906954.aspx</link><pubDate>Thu, 29 Nov 2007 13:05:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/29/1906954.aspx</guid><wfw:comment>comments/1906954.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/29/1906954.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/1906954.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1906954</trackback:ping><description>SimpleDateFormat简介&lt;img src ="aggbug/1906954.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>打高尔夫的大学生多是贱货</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/23/1898889.aspx</link><pubDate>Fri, 23 Nov 2007 10:06:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/23/1898889.aspx</guid><wfw:comment>comments/1898889.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/23/1898889.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/1898889.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1898889</trackback:ping><description>打高尔夫的大学生多是贱货&lt;img src ="aggbug/1898889.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>实战 JDOM</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/21/1896344.aspx</link><pubDate>Wed, 21 Nov 2007 13:52:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/21/1896344.aspx</guid><wfw:comment>comments/1896344.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/21/1896344.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/1896344.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1896344</trackback:ping><description>一. jdom如何创建xml
    一般思路：首先创建根元素，文档元素。然后将根元素添加文档中。 然后创建子元素、文件元素、属性将这元素添加到子元素中。再将子元素添加到根元素中。 这样就形成了一个树关的xml文档了。
 二. XML文档解析
    JDOM 不但可以很方便的建立XML文档，它的另一个用处是它能够读取并操作现有的 XML 数据。
　JDOM的解析器在org.jdom.input.*这个包里，其中的DOMBuilder的功能是将DOM模型的Document解析成JDOM模型的 Document；SAXBuilder的功能是从文件或流中解析出符合JDOM模型的XML树。由于我们经常要从一个文件里读取数据，因此我们应该采用后者作为解析工具。&lt;img src ="aggbug/1896344.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>关于思考</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/19/1892123.aspx</link><pubDate>Mon, 19 Nov 2007 11:26:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/19/1892123.aspx</guid><wfw:comment>comments/1892123.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/19/1892123.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/1892123.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1892123</trackback:ping><description>关于思考&lt;img src ="aggbug/1892123.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>浅谈程序员如何正确面对压力 </title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/14/1883816.aspx</link><pubDate>Wed, 14 Nov 2007 10:36:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/14/1883816.aspx</guid><wfw:comment>comments/1883816.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/14/1883816.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/1883816.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1883816</trackback:ping><description>如果我们每天忙着产奶、生金蛋、吃草，压力必然会很大。那我们又应该怎么办呢？被问题压倒，还是想办法面对和解决呢？下面就提出的几个问题，简单分享一下我的观点。&lt;img src ="aggbug/1883816.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>东子</dc:creator><title>Velocity简介</title><link>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/13/1881838.aspx</link><pubDate>Tue, 13 Nov 2007 11:21:00 GMT</pubDate><guid>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/13/1881838.aspx</guid><wfw:comment>comments/1881838.aspx</wfw:comment><comments>http://blog.csdn.net/sunyadongwanghbjm/archive/2007/11/13/1881838.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/1881838.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1881838</trackback:ping><description>Velocity模版引擎&lt;img src ="aggbug/1881838.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>