﻿<?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/109506.html</link><description>Share my world.
Share your viewpoint.</description><language>zh-cn</language><lastBuildDate>Tue, 24 Jun 2008 14:27:21 GMT</lastBuildDate><pubDate>Tue, 24 Jun 2008 14:27:21 GMT</pubDate><ttl>60</ttl><item><title>人工神经网络入门（4） —— AForge.Net简介</title><link>http://www.cnblogs.com/gpcuster/archive/2008/06/24/1229140.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Tue, 24 Jun 2008 13:05:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2008/06/24/1229140.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/1229140.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2008/06/24/1229140.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/1229140.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/1229140.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 这篇文章中，我们将介绍一个用C#实现的框架AForge，利用这个框架，您可以方便地操作人工网络，计算机视觉，机器学习，图像处理，遗传算法等<br><br>&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2008/06/24/1229140.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/1229140.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-06-24 21:05 <a href="http://www.cnblogs.com/gpcuster/archive/2008/06/24/1229140.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>人工神经网络入门（3） —— 多层人工神经网络应用示例</title><link>http://www.cnblogs.com/gpcuster/archive/2008/06/22/1227733.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Sun, 22 Jun 2008 12:15:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2008/06/22/1227733.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/1227733.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2008/06/22/1227733.html#Feedback</comments><slash:comments>8</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/1227733.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/1227733.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 我们可以使用第一篇文章中的代码来计算这个结果http://www.cnblogs.com/Files/gpcuster/ANN1.rar（需要修改其中的训练集），可以发现学习后的结果不能让我们满意，原因是单层神经网络学习能力有限，需要使用更加复杂的网络来学习。<br>在这一篇文章中，我们将使用一个新的多层神经网络来学习。&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2008/06/22/1227733.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/1227733.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-06-22 20:15 <a href="http://www.cnblogs.com/gpcuster/archive/2008/06/22/1227733.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>利用模拟退火算法求解TSP问题</title><link>http://www.cnblogs.com/gpcuster/archive/2008/06/15/1222245.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Sun, 15 Jun 2008 02:51:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2008/06/15/1222245.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/1222245.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2008/06/15/1222245.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/1222245.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/1222245.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;示例代码下载/Files/gpcuster/TSP.zip介绍组合优化算法用于解决在一个解空间非常大的情况下快速地求解近似解。这类算法可用于资源管理，操作管理，质量控制等等问题，并...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2008/06/15/1222245.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/1222245.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-06-15 10:51 <a href="http://www.cnblogs.com/gpcuster/archive/2008/06/15/1222245.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>人工神经网络入门（2） —— 人工神经基本概念介绍</title><link>http://www.cnblogs.com/gpcuster/archive/2008/06/03/1213008.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Tue, 03 Jun 2008 11:14:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2008/06/03/1213008.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/1213008.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2008/06/03/1213008.html#Feedback</comments><slash:comments>13</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/1213008.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/1213008.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 如果您有疑问，可以先参考&nbsp;FAQ如果您未找到满意的答案，可以在下面留言：）首先向大家道歉，很长时间没有来更新文章了。最近杂事太多，不好意思。1介绍在上一篇文章中，我们...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2008/06/03/1213008.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/1213008.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-06-03 19:14 <a href="http://www.cnblogs.com/gpcuster/archive/2008/06/03/1213008.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>人工神经网络入门（0） —— 关于人工神经网络的FAQ</title><link>http://www.cnblogs.com/gpcuster/archive/2008/05/22/1204705.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Thu, 22 May 2008 04:36:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2008/05/22/1204705.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/1204705.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2008/05/22/1204705.html#Feedback</comments><slash:comments>17</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/1204705.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/1204705.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 今天早上发了一篇关于ANN的文章，给大家演示了一个简单的学习AND运算和OR运算的程序，但是发现大家有很多疑问。所以通过这篇文章，我希望能对大家的一些常见的疑问给予解答这里的训练一词怎...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2008/05/22/1204705.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/1204705.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-05-22 12:36 <a href="http://www.cnblogs.com/gpcuster/archive/2008/05/22/1204705.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>人工神经网络入门（1） —— 单层人工神经网络应用示例</title><link>http://www.cnblogs.com/gpcuster/archive/2008/05/22/1204456.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Wed, 21 May 2008 23:10:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2008/05/22/1204456.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/1204456.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2008/05/22/1204456.html#Feedback</comments><slash:comments>28</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/1204456.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/1204456.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 还记得在2年前刚刚接触RoboCup的时候，从学长口中听说了ANN（人工神经网络），这个东西可神奇了，他能通过学会从而对一些问题进行足够好处理。就像咱们人一样，可以通过学习，了解新的知识。<br>但是2年了，一直想学习ANN，但是一直没有成功。原因很多，其中主要的原因是咱们国内的教程中关于这个技术的介绍过于理论化，以至于我们基础差和自学者望而却步。<br>现在，我希望通过一个简单的示例，让大家先有一个感性的认识，然后再了解一些相应的理论，从而达到更好的学习效果。&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2008/05/22/1204456.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/1204456.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-05-22 07:10 <a href="http://www.cnblogs.com/gpcuster/archive/2008/05/22/1204456.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>匈牙利算法的C#实现版本</title><link>http://www.cnblogs.com/gpcuster/archive/2008/04/01/1133456.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Tue, 01 Apr 2008 12:50:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2008/04/01/1133456.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/1133456.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2008/04/01/1133456.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/1133456.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/1133456.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 算法的原理：&nbsp;&nbsp;範例：有四位教授被分派開設四門課程，如何指派使所需的總準備時間為最小。已知個人對各課程之準備時間如下表所示：...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2008/04/01/1133456.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/1133456.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-04-01 20:50 <a href="http://www.cnblogs.com/gpcuster/archive/2008/04/01/1133456.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>A尾相等数</title><link>http://www.cnblogs.com/gpcuster/archive/2008/03/04/1089520.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Tue, 04 Mar 2008 00:25:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2008/03/04/1089520.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/1089520.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2008/03/04/1089520.html#Feedback</comments><slash:comments>12</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/1089520.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/1089520.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 题目描述：从键盘输入一个int数A（A&gt;1）,如果存在int数X和Y（X&gt;Y），使得A^X和A^Y均大于1000，且他们的末尾三位数相等，则称X和Y是一对&#8220;A尾相等...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2008/03/04/1089520.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/1089520.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-03-04 08:25 <a href="http://www.cnblogs.com/gpcuster/archive/2008/03/04/1089520.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>利用遗传算法求解旅行商问题</title><link>http://www.cnblogs.com/gpcuster/archive/2008/01/12/1036135.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Sat, 12 Jan 2008 04:49:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2008/01/12/1036135.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/1036135.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2008/01/12/1036135.html#Feedback</comments><slash:comments>11</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/1036135.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/1036135.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 可执行文件下载：/Files/gpcuster/TSPGA.rar修正显示的版本下载：/Files/gpcuster/TSPGA2.rar简介首先，咱们可以看看用遗传算法求解的旅...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2008/01/12/1036135.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/1036135.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-12 12:49 <a href="http://www.cnblogs.com/gpcuster/archive/2008/01/12/1036135.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><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>启发式路径搜索：A*</title><link>http://www.cnblogs.com/gpcuster/archive/2007/12/31/1021442.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Mon, 31 Dec 2007 00:47:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/12/31/1021442.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/1021442.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/12/31/1021442.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/1021442.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/1021442.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/12/31/1021442.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/1021442.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-31 08:47 <a href="http://www.cnblogs.com/gpcuster/archive/2007/12/31/1021442.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>某公司定制培训班笔试最后一题解题思路和解题代码</title><link>http://www.cnblogs.com/gpcuster/archive/2007/12/19/1005666.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Wed, 19 Dec 2007 04:28:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/12/19/1005666.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/1005666.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/12/19/1005666.html#Feedback</comments><slash:comments>9</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/1005666.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/1005666.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;题目描述：有3种面额的硬币：1分，2分和5分的。现在有100枚这样的硬币，面额总和是2.47元，求共有多少种可能，且1分，2分和5分的硬币各有多少。解题思路：假设1分，2分...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/12/19/1005666.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/1005666.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-19 12:28 <a href="http://www.cnblogs.com/gpcuster/archive/2007/12/19/1005666.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>关于使用位操作与使用取模操作求奇偶数的性能比较。</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/22/968490.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Thu, 22 Nov 2007 05:41:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/22/968490.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/968490.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/22/968490.html#Feedback</comments><slash:comments>31</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/968490.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/968490.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;1using&nbsp;System;&nbsp;2using&nbsp;System.Collections.Generic;&nbsp;3using&nbsp;...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/11/22/968490.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/968490.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-22 13:41 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/22/968490.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>7</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>将数字转换为中文表示</title><link>http://www.cnblogs.com/gpcuster/archive/2007/11/04/949090.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Sun, 04 Nov 2007 11:24:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/11/04/949090.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/949090.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/11/04/949090.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/949090.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/949090.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/04/949090.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/949090.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 19:24 <a href="http://www.cnblogs.com/gpcuster/archive/2007/11/04/949090.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>打印一个N位二进制数的所有表示</title><link>http://www.cnblogs.com/gpcuster/archive/2007/10/17/927354.html</link><dc:creator>逖靖寒</dc:creator><author>逖靖寒</author><pubDate>Wed, 17 Oct 2007 04:41:00 GMT</pubDate><guid>http://www.cnblogs.com/gpcuster/archive/2007/10/17/927354.html</guid><wfw:comment>http://www.cnblogs.com/gpcuster/comments/927354.html</wfw:comment><comments>http://www.cnblogs.com/gpcuster/archive/2007/10/17/927354.html#Feedback</comments><slash:comments>61</slash:comments><wfw:commentRss>http://www.cnblogs.com/gpcuster/comments/commentRss/927354.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/gpcuster/services/trackbacks/927354.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 问题的描述如下：用户需要打印一个N位二进制数的所有表示。如：1位二进制数的所有表示：01&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;2位二进制数的所有表示：0001...&nbsp;&nbsp;<a href='http://www.cnblogs.com/gpcuster/archive/2007/10/17/927354.html'>阅读全文</a><img src ="http://www.cnblogs.com/gpcuster/aggbug/927354.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-10-17 12:41 <a href="http://www.cnblogs.com/gpcuster/archive/2007/10/17/927354.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>