<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>清清月儿 .NET万花筒 Asp.net技术 Asp.net教程 Asp.net源码 Asp.net基础 Asp.net控件 Asp.net入门  - .NET C#算法</title><link>http://blog.csdn.net/21aspnet/category/286009.aspx</link><description /><dc:language>zh-CN</dc:language><lastUpdateTime>Fri, 18 Apr 2008 10:41:00 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>清清月儿</dc:creator><title>C#MD5算法</title><link>http://blog.csdn.net/21aspnet/archive/2007/03/24/1540005.aspx</link><pubDate>Sat, 24 Mar 2007 17:00:00 GMT</pubDate><guid>http://blog.csdn.net/21aspnet/archive/2007/03/24/1540005.aspx</guid><wfw:comment>http://blog.csdn.net/21aspnet/comments/1540005.aspx</wfw:comment><comments>http://blog.csdn.net/21aspnet/archive/2007/03/24/1540005.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/21aspnet/comments/commentRss/1540005.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1540005</trackback:ping><description>C#MD5算法&lt;img src ="http://blog.csdn.net/21aspnet/aggbug/1540005.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>清清月儿</dc:creator><title>C# A*算法实现8数或者15数问题</title><link>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539954.aspx</link><pubDate>Sat, 24 Mar 2007 16:25:00 GMT</pubDate><guid>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539954.aspx</guid><wfw:comment>http://blog.csdn.net/21aspnet/comments/1539954.aspx</wfw:comment><comments>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539954.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/21aspnet/comments/commentRss/1539954.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1539954</trackback:ping><description>C# A*算法实现8数或者15数问题&lt;img src ="http://blog.csdn.net/21aspnet/aggbug/1539954.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>清清月儿</dc:creator><title>C#深度和广度优先分油问题</title><link>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539951.aspx</link><pubDate>Sat, 24 Mar 2007 16:24:00 GMT</pubDate><guid>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539951.aspx</guid><wfw:comment>http://blog.csdn.net/21aspnet/comments/1539951.aspx</wfw:comment><comments>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539951.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/21aspnet/comments/commentRss/1539951.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1539951</trackback:ping><description>C#深度和广度优先分油问题&lt;img src ="http://blog.csdn.net/21aspnet/aggbug/1539951.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>清清月儿</dc:creator><title>C#把一个int数组的数字从小到大排列</title><link>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539685.aspx</link><pubDate>Sat, 24 Mar 2007 12:54:00 GMT</pubDate><guid>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539685.aspx</guid><wfw:comment>http://blog.csdn.net/21aspnet/comments/1539685.aspx</wfw:comment><comments>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539685.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/21aspnet/comments/commentRss/1539685.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1539685</trackback:ping><description>C#把一个int数组的数字从小到大排列&lt;img src ="http://blog.csdn.net/21aspnet/aggbug/1539685.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>清清月儿</dc:creator><title>皇后问题</title><link>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539679.aspx</link><pubDate>Sat, 24 Mar 2007 12:49:00 GMT</pubDate><guid>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539679.aspx</guid><wfw:comment>http://blog.csdn.net/21aspnet/comments/1539679.aspx</wfw:comment><comments>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539679.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/21aspnet/comments/commentRss/1539679.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1539679</trackback:ping><description>皇后问题&lt;img src ="http://blog.csdn.net/21aspnet/aggbug/1539679.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>清清月儿</dc:creator><title>C#解号称爱因斯坦出的智力题</title><link>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539677.aspx</link><pubDate>Sat, 24 Mar 2007 12:48:00 GMT</pubDate><guid>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539677.aspx</guid><wfw:comment>http://blog.csdn.net/21aspnet/comments/1539677.aspx</wfw:comment><comments>http://blog.csdn.net/21aspnet/archive/2007/03/24/1539677.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/21aspnet/comments/commentRss/1539677.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1539677</trackback:ping><description>C#解号称爱因斯坦出的智力题&lt;img src ="http://blog.csdn.net/21aspnet/aggbug/1539677.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>清清月儿</dc:creator><title>单链表的定义以及使用</title><link>http://blog.csdn.net/21aspnet/archive/2007/03/21/1536929.aspx</link><pubDate>Wed, 21 Mar 2007 23:47:00 GMT</pubDate><guid>http://blog.csdn.net/21aspnet/archive/2007/03/21/1536929.aspx</guid><wfw:comment>http://blog.csdn.net/21aspnet/comments/1536929.aspx</wfw:comment><comments>http://blog.csdn.net/21aspnet/archive/2007/03/21/1536929.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/21aspnet/comments/commentRss/1536929.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1536929</trackback:ping><description>单链表的定义以及使用&lt;img src ="http://blog.csdn.net/21aspnet/aggbug/1536929.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>清清月儿</dc:creator><title>C#的四种排序算法 </title><link>http://blog.csdn.net/21aspnet/archive/2007/03/20/1534410.aspx</link><pubDate>Tue, 20 Mar 2007 01:10:00 GMT</pubDate><guid>http://blog.csdn.net/21aspnet/archive/2007/03/20/1534410.aspx</guid><wfw:comment>http://blog.csdn.net/21aspnet/comments/1534410.aspx</wfw:comment><comments>http://blog.csdn.net/21aspnet/archive/2007/03/20/1534410.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/21aspnet/comments/commentRss/1534410.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1534410</trackback:ping><description>本文介绍了C#的四种排序算法：冒泡排序、选择排序、插入排序和希尔排序。冒泡排序。using System；namespace BubbleSorter.{ public class BubbleSorter.{ public void Sort（int [] list）bool done=false；j=1；while（（j＜list.Length）&lt;img src ="http://blog.csdn.net/21aspnet/aggbug/1534410.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>