﻿<?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>博客园-逖靖寒的世界-随笔分类-读书</title><link>http://www.cnblogs.com/gpcuster/category/92969.html</link><description>Share my world.
Share your viewpoint.</description><language>zh-cn</language><lastBuildDate>Thu, 22 May 2008 01:55:03 GMT</lastBuildDate><pubDate>Thu, 22 May 2008 01:55:03 GMT</pubDate><ttl>60</ttl><item><title>C#实现遗传算法，模拟花朵的进化。</title><link>http://www.cnblogs.com/gpcuster/archive/2008/01/09/1031952.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Wed, 09 Jan 2008 06:39:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2008/01/09/1031952.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/1031952.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2008/01/09/1031952.html#Feedback</comments><slash:comments>24</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/1031952.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/1031952.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;以下代码实现了一个简单的花朵进化的模拟过程。花朵的种群数量是10，共进化了50代。通过运行程序，你会发现通过不断的进化，种群的总的适应环境的能力在逐步提高（fitness的值下...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2008/01/09/1031952.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/1031952.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2008-01-09 14:39 <a href="http://www.cnblogs.com/gpcuster/archive/2008/01/09/1031952.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《Head First HTML with CSS and XHTML》 读后感</title><link>http://www.cnblogs.com/gpcuster/archive/2007/12/16/997021.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Sun, 16 Dec 2007 14:15:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/12/16/997021.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/997021.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/12/16/997021.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/997021.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/997021.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;《HeadFirstHTMLwithCSSandXHTML》读后感花了整整2个星期的时间，终于把O&#8217;Reilly出版社出版的《HeadFirst...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/12/16/997021.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/997021.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-12-16 22:15 <a href="http://www.cnblogs.com/gpcuster/archive/2007/12/16/997021.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>动态规划：利用WarShell算法求有向图的传递闭包</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/27/974555.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Tue, 27 Nov 2007 11:05:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/27/974555.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/974555.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/27/974555.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/974555.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/974555.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;1using&nbsp;System;&nbsp;&nbsp;2using&nbsp;System.Collections.Generic;&nbsp;&nbsp;3u...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/11/27/974555.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/974555.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-11-27 19:05 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/27/974555.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>时空权衡：利用额外的空间提高字符串匹配的速度</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/27/973517.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Tue, 27 Nov 2007 00:58:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/27/973517.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/973517.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/27/973517.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/973517.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/973517.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;1using&nbsp;System;&nbsp;&nbsp;2using&nbsp;System.Collections.Generic;&nbsp;&nbsp;3u...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/11/27/973517.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/973517.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-11-27 08:58 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/27/973517.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>变治法：用C#实现堆的建立与堆排序</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/24/971028.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Sat, 24 Nov 2007 05:56:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/24/971028.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/971028.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/24/971028.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/971028.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/971028.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;1using&nbsp;System;&nbsp;&nbsp;2using&nbsp;System.Collections.Generic;&nbsp;&nbsp;3u...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/11/24/971028.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/971028.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-11-24 13:56 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/24/971028.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>如何高效求2个整数的乘积。</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/21/967236.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Wed, 21 Nov 2007 07:02:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/21/967236.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/967236.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/21/967236.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/967236.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/967236.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 利用减治法的思想来实现，将2个整数相乘只需要进行简单的加法和位运算。实现如下：&nbsp;1using&nbsp;System;&nbsp;2using&nbsp;System.C...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/11/21/967236.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/967236.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-11-21 15:02 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/21/967236.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>如何高效地判断奇数和偶数</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/21/967155.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Wed, 21 Nov 2007 06:22:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/21/967155.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/967155.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/21/967155.html#Feedback</comments><slash:comments>44</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/967155.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/967155.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 在我们日常的编程当中，常常会遇到判断某个整数属于奇数还是偶数的情况。大家一般的处理做法是用这个整数和2取模。然后判断是等于1还是等于0。这里，我要为大家介绍一种快速有效的判断做法，利用...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/11/21/967155.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/967155.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-11-21 14:22 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/21/967155.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>编程实现1到N个数的所有排列组合</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/17/962848.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Sat, 17 Nov 2007 13:44:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/17/962848.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/962848.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/17/962848.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/962848.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/962848.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 编程实现1到N个数的所有排列组合。如：n=3则得到的序列如下：123，132，213，231，312，321我的实现如下，大家看看如何：&nbsp;&nbsp;1...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/11/17/962848.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/962848.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-11-17 21:44 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/17/962848.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>减治法：C#实现插入排序</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/14/959484.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Wed, 14 Nov 2007 09:51:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/14/959484.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/959484.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/14/959484.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/959484.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/959484.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;1using&nbsp;System;&nbsp;2using&nbsp;System.Collections.Generic;&nbsp;3using&nbsp;System.T...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/11/14/959484.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/959484.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-11-14 17:51 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/14/959484.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>分治法：用C#实现快速排序</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/13/957894.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Tue, 13 Nov 2007 05:08:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/13/957894.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/957894.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/13/957894.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/957894.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/957894.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;&nbsp;1using&nbsp;System;&nbsp;&nbsp;2using&nbsp;System.Collections.Generic;&nbsp;...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/11/13/957894.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/957894.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-11-13 13:08 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/13/957894.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>分治法：用C#实现归并排序</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/12/956804.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Mon, 12 Nov 2007 06:44:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/12/956804.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/956804.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/12/956804.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/956804.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/956804.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 根据《算法设计与分析基础》中对归并排序的描述，写了一分C#代码实现。具体的实现代码如下：&nbsp;&nbsp;1using&nbsp;System;&nbsp;&nbsp;2usin...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/11/12/956804.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/956804.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-11-12 14:44 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/12/956804.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>今天突然理解了“volatile”</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/12/956626.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Mon, 12 Nov 2007 04:36:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/12/956626.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/956626.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/12/956626.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/956626.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/956626.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 首先咱们可以看一下MSDN对volatile的定义：Thevolatilekeywordindicatesthatafieldcanbemodifiedintheprogr...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/11/12/956626.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/956626.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-11-12 12:36 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/12/956626.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>求解2个数的最大公约数 和 求解质因数</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/04/948681.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Sun, 04 Nov 2007 01:08:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/04/948681.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/948681.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/04/948681.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/948681.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/948681.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;&nbsp;1using&nbsp;System;&nbsp;&nbsp;2using&nbsp;System.Collections.Generic;&nbsp;...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/11/04/948681.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/948681.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-11-04 09:08 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/04/948681.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>《SQL Server 2005 编程入门经典》 Chapter 1</title><link>http://www.cnblogs.com/gpcuster/archive/2007/05/19/752316.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Sat, 19 May 2007 04:01:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/05/19/752316.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/752316.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/05/19/752316.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/752316.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/752316.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 对系统数据库（System Databases）有一个基本的介绍&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/05/19/752316.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/752316.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-05-19 12:01 <a href="http://www.cnblogs.com/gpcuster/archive/2007/05/19/752316.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>读《Introduction to Algorithms(Sencond Edition)》 (1)</title><link>http://www.cnblogs.com/gpcuster/archive/2007/05/08/739278.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Tue, 08 May 2007 09:18:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/05/08/739278.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/739278.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/05/08/739278.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/739278.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/739278.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 今天开始学习著名的算法巨作《IntroductiontoAlgorithms(SencondEdition)》花了不少时间才把书中的伪代码解释看明白。然后阅读了其中的一个简单的范例。以下是这个...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/05/08/739278.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/739278.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-05-08 17:18 <a href="http://www.cnblogs.com/gpcuster/archive/2007/05/08/739278.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>读《GDI+ 图形程序设计》</title><link>http://www.cnblogs.com/gpcuster/archive/2007/04/12/711171.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Thu, 12 Apr 2007 12:01:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/04/12/711171.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/711171.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/04/12/711171.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/711171.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/711171.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 今天把MaheshChand写的GraphicsProgrammingwithGDI+看完了。个人感觉Microsoft设计的这个图形编程接口挺人性化的。很多基本的设计都可以非常简单的实...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/04/12/711171.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/711171.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-04-12 20:01 <a href="http://www.cnblogs.com/gpcuster/archive/2007/04/12/711171.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>初读《Head First Design Patterns》</title><link>http://www.cnblogs.com/gpcuster/archive/2007/02/22/653856.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Thu, 22 Feb 2007 13:21:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/02/22/653856.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/653856.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/02/22/653856.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/653856.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/653856.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 今天刚刚读完了《HeadFirstDesignPatterns》，有不少感想。第一：这本书我完整看完的第一本英文原版书，挺有成就感的。想不到从前的英语盲现在也可以看原版书了第二：这本书是我在寒假...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/02/22/653856.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/653856.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://gpcuster.cnblogs.com/" target="_blank">逖靖寒</a> 2007-02-22 21:21 <a href="http://www.cnblogs.com/gpcuster/archive/2007/02/22/653856.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>