﻿<?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/kkun/CommentsRSS.aspx</link><description>这刻在望著父亲笑容时,竟不知不觉的无言</description><language>zh-cn</language><pubDate>Wed, 30 May 2012 05:45:38 GMT</pubDate><lastBuildDate>Wed, 30 May 2012 05:45:38 GMT</lastBuildDate><generator>cnblogs</generator><item><title>Re:经典排序算法 &amp;ndash; 插入排序Insertion sort</title><link>http://www.cnblogs.com/kkun/archive/2012/05/14/2260265.html#2376978</link><dc:creator>仙道男</dc:creator><author>仙道男</author><pubDate>Mon, 14 May 2012 13:56:18 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/05/14/2260265.html#2376978</guid><description><![CDATA[学习了<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">仙道男</a> 2012-05-14 21:56 <a href="http://www.cnblogs.com/kkun/archive/2012/05/14/2260265.html#2376978#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2012/05/14/2260312.html#2376432</link><dc:creator>huoyj</dc:creator><author>huoyj</author><pubDate>Mon, 14 May 2012 02:42:07 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/05/14/2260312.html#2376432</guid><description><![CDATA[楼主可以把这些算法归纳成一个电子书<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">huoyj</a> 2012-05-14 10:42 <a href="http://www.cnblogs.com/kkun/archive/2012/05/14/2260312.html#2376432#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2012/05/11/2260312.html#2374972</link><dc:creator>恩戴米恩</dc:creator><author>恩戴米恩</author><pubDate>Fri, 11 May 2012 07:15:49 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/05/11/2260312.html#2374972</guid><description><![CDATA[找出来这两个数字就OK啦！~~~~<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">恩戴米恩</a> 2012-05-11 15:15 <a href="http://www.cnblogs.com/kkun/archive/2012/05/11/2260312.html#2374972#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:改写自SqlHelper的SqliteHelper</title><link>http://www.cnblogs.com/kkun/archive/2012/05/10/1360744.html#2373996</link><dc:creator>wanmingtom</dc:creator><author>wanmingtom</author><pubDate>Thu, 10 May 2012 06:49:22 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/05/10/1360744.html#2373996</guid><description><![CDATA[二楼说的对，及其容易文件被锁住<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">wanmingtom</a> 2012-05-10 14:49 <a href="http://www.cnblogs.com/kkun/archive/2012/05/10/1360744.html#2373996#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2012/05/07/2260312.html#2371573</link><dc:creator>勇在心李</dc:creator><author>勇在心李</author><pubDate>Mon, 07 May 2012 12:10:22 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/05/07/2260312.html#2371573</guid><description><![CDATA[谢谢，收藏了。<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">勇在心李</a> 2012-05-07 20:10 <a href="http://www.cnblogs.com/kkun/archive/2012/05/07/2260312.html#2371573#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:为指定的XML文件生成类并反序列化</title><link>http://www.cnblogs.com/kkun/archive/2012/05/05/1550889.html#2370177</link><dc:creator>斯克迪亚</dc:creator><author>斯克迪亚</author><pubDate>Sat, 05 May 2012 07:18:16 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/05/05/1550889.html#2370177</guid><description><![CDATA[^^<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">斯克迪亚</a> 2012-05-05 15:18 <a href="http://www.cnblogs.com/kkun/archive/2012/05/05/1550889.html#2370177#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:为指定的XML文件生成类并反序列化</title><link>http://www.cnblogs.com/kkun/archive/2012/04/27/1550889.html#2365261</link><dc:creator>kkun</dc:creator><author>kkun</author><pubDate>Fri, 27 Apr 2012 05:37:12 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/04/27/1550889.html#2365261</guid><description><![CDATA[[quote]斯克迪亚：哦，貌似转换时有BUG，把很多用普通数组的地方都用二维数组类型了，生成的源码里批量替换[][]为[]就行了。[/quote]
你真认真,佩服<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">kkun</a> 2012-04-27 13:37 <a href="http://www.cnblogs.com/kkun/archive/2012/04/27/1550889.html#2365261#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:为指定的XML文件生成类并反序列化</title><link>http://www.cnblogs.com/kkun/archive/2012/04/19/1550889.html#2359596</link><dc:creator>斯克迪亚</dc:creator><author>斯克迪亚</author><pubDate>Thu, 19 Apr 2012 08:57:12 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/04/19/1550889.html#2359596</guid><description><![CDATA[哦，貌似转换时有BUG，把很多用普通数组的地方都用二维数组类型了，生成的源码里批量替换[][]为[]就行了。<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">斯克迪亚</a> 2012-04-19 16:57 <a href="http://www.cnblogs.com/kkun/archive/2012/04/19/1550889.html#2359596#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:为指定的XML文件生成类并反序列化</title><link>http://www.cnblogs.com/kkun/archive/2012/04/19/1550889.html#2359583</link><dc:creator>斯克迪亚</dc:creator><author>斯克迪亚</author><pubDate>Thu, 19 Apr 2012 08:54:07 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/04/19/1550889.html#2359583</guid><description><![CDATA[为啥我这个反序列化时就报错了呢？


无法生成临时类(result=1)。
error CS0030: 无法将类型“propertiesProperty[]”转换为“propertiesProperty”
error CS0030: 无法将类型“propertiesProperty[]”转换为“propertiesProperty”
error CS0030: 无法将类型“tile[]”转换为“tile”
error CS0030: 无法将类型“propertiesProperty[]”转换为“propertiesProperty”
error CS0029: 无法将类型“propertiesProperty”隐式转换为“propertiesProperty[]”
error CS0029: 无法将类型“propertiesProperty”隐式转换为“propertiesProperty[]”
error CS0029: 无法将类型“tile”隐式转换为“tile[]”
error CS0029: 无法将类型“propertiesProperty”隐式转换为“propertiesProperty[]”<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">斯克迪亚</a> 2012-04-19 16:54 <a href="http://www.cnblogs.com/kkun/archive/2012/04/19/1550889.html#2359583#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2012/04/11/2260312.html#2352624</link><dc:creator>kkun</dc:creator><author>kkun</author><pubDate>Wed, 11 Apr 2012 08:16:29 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/04/11/2260312.html#2352624</guid><description><![CDATA[[quote]南柯一梦_hw：
你这里的最后那题的数组好像多了个2喵

出个小题目
已知数组长度为100,且基本有序,里面有仅有两个数字位置不对,但具体是那两个数字不知道,数字不重复
例如[1 99 （2） 3 4 5 6 7 8 9 10 11 …… 88 89 90 91 92 93 94 95 96 97 98 （2） 100 ]
要求从小到大排序[/quote]
手误了,呵呵<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">kkun</a> 2012-04-11 16:16 <a href="http://www.cnblogs.com/kkun/archive/2012/04/11/2260312.html#2352624#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2012/04/08/2260312.html#2349917</link><dc:creator>南柯一梦_hw</dc:creator><author>南柯一梦_hw</author><pubDate>Sun, 08 Apr 2012 08:17:30 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/04/08/2260312.html#2349917</guid><description><![CDATA[你这里的最后那题的数组好像多了个2喵

出个小题目
已知数组长度为100,且基本有序,里面有仅有两个数字位置不对,但具体是那两个数字不知道,数字不重复
例如[1 99 （2） 3 4 5 6 7 8 9 10 11 …… 88 89 90 91 92 93 94 95 96 97 98 （2） 100 ]
要求从小到大排序<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">南柯一梦_hw</a> 2012-04-08 16:17 <a href="http://www.cnblogs.com/kkun/archive/2012/04/08/2260312.html#2349917#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 归并排序Merge sort</title><link>http://www.cnblogs.com/kkun/archive/2012/03/28/2260271.html#2342015</link><dc:creator>kkun</dc:creator><author>kkun</author><pubDate>Wed, 28 Mar 2012 06:07:49 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/03/28/2260271.html#2342015</guid><description><![CDATA[[quote]hhby：
[quote]原理,把原始数组分成若干子数组,对每一个子数组进行排序,[/quote]
子数组怎么排序的？[/quote]
相临两个子数组归并排序...就是文章里介绍的方法<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">kkun</a> 2012-03-28 14:07 <a href="http://www.cnblogs.com/kkun/archive/2012/03/28/2260271.html#2342015#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 归并排序Merge sort</title><link>http://www.cnblogs.com/kkun/archive/2012/03/15/2260271.html#2331507</link><dc:creator>hhby</dc:creator><author>hhby</author><pubDate>Thu, 15 Mar 2012 06:18:37 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/03/15/2260271.html#2331507</guid><description><![CDATA[[quote]原理,把原始数组分成若干子数组,对每一个子数组进行排序,[/quote]
子数组怎么排序的？<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">hhby</a> 2012-03-15 14:18 <a href="http://www.cnblogs.com/kkun/archive/2012/03/15/2260271.html#2331507#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 桶排序Bucket sort</title><link>http://www.cnblogs.com/kkun/archive/2012/03/09/2260267.html#2326557</link><dc:creator>kkun</dc:creator><author>kkun</author><pubDate>Fri, 09 Mar 2012 03:45:17 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/03/09/2260267.html#2326557</guid><description><![CDATA[[quote]天空海阔：
@kkun
如果有0和负数了?  用int.MinValue?[/quote]
索引可以是0,但从来不会是负数...这种情况是处理不了的
不过你可以加上一个数字入桶,出桶的时候再减去这个数字<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">kkun</a> 2012-03-09 11:45 <a href="http://www.cnblogs.com/kkun/archive/2012/03/09/2260267.html#2326557#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 桶排序Bucket sort</title><link>http://www.cnblogs.com/kkun/archive/2012/03/05/2260267.html#2322988</link><dc:creator>天空海阔</dc:creator><author>天空海阔</author><pubDate>Mon, 05 Mar 2012 04:01:12 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/03/05/2260267.html#2322988</guid><description><![CDATA[@kkun
如果有0和负数了?  用int.MinValue?<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">天空海阔</a> 2012-03-05 12:01 <a href="http://www.cnblogs.com/kkun/archive/2012/03/05/2260267.html#2322988#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 珠排序Bead Sort</title><link>http://www.cnblogs.com/kkun/archive/2012/02/11/2260301.html#2306748</link><dc:creator>康 桥</dc:creator><author>康 桥</author><pubDate>Sat, 11 Feb 2012 12:42:04 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/02/11/2260301.html#2306748</guid><description><![CDATA[这太巧妙了……<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">康 桥</a> 2012-02-11 20:42 <a href="http://www.cnblogs.com/kkun/archive/2012/02/11/2260301.html#2306748#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 快速排序Quick sort</title><link>http://www.cnblogs.com/kkun/archive/2012/01/06/2260270.html#2287492</link><dc:creator>zunkun</dc:creator><author>zunkun</author><pubDate>Thu, 05 Jan 2012 23:46:27 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2012/01/06/2260270.html#2287492</guid><description><![CDATA[文章出处http://www.cnblogs.com/kkun/archive/2011/11/23/2260270.html?login=1#commentform<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">zunkun</a> 2012-01-06 07:46 <a href="http://www.cnblogs.com/kkun/archive/2012/01/06/2260270.html#2287492#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2011/12/16/2260312.html#2271631</link><dc:creator>xhp</dc:creator><author>xhp</author><pubDate>Fri, 16 Dec 2011 03:11:16 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/12/16/2260312.html#2271631</guid><description><![CDATA[博主，头像不错。<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">xhp</a> 2011-12-16 11:11 <a href="http://www.cnblogs.com/kkun/archive/2011/12/16/2260312.html#2271631#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 计数排序Counting sort</title><link>http://www.cnblogs.com/kkun/archive/2011/12/12/2260299.html#2267547</link><dc:creator>hoodlum1980</dc:creator><author>hoodlum1980</author><pubDate>Sun, 11 Dec 2011 20:48:33 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/12/12/2260299.html#2267547</guid><description><![CDATA[代码写的不对把？<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">hoodlum1980</a> 2011-12-12 04:48 <a href="http://www.cnblogs.com/kkun/archive/2011/12/12/2260299.html#2267547#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 桶排序Bucket sort</title><link>http://www.cnblogs.com/kkun/archive/2011/12/09/2260267.html#2266416</link><dc:creator>kkun</dc:creator><author>kkun</author><pubDate>Fri, 09 Dec 2011 11:14:20 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/12/09/2260267.html#2266416</guid><description><![CDATA[[quote]iTech：有重复的元素呢？[/quote]
那就使用集合...
[code=csharp]
List&lt;int&gt;[] buget = new List&lt;int&gt;[10];
[/code]<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">kkun</a> 2011-12-09 19:14 <a href="http://www.cnblogs.com/kkun/archive/2011/12/09/2260267.html#2266416#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 桶排序Bucket sort</title><link>http://www.cnblogs.com/kkun/archive/2011/12/09/2260267.html#2266140</link><dc:creator>iTech</dc:creator><author>iTech</author><pubDate>Fri, 09 Dec 2011 07:23:56 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/12/09/2260267.html#2266140</guid><description><![CDATA[有重复的元素呢？<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">iTech</a> 2011-12-09 15:23 <a href="http://www.cnblogs.com/kkun/archive/2011/12/09/2260267.html#2266140#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2011/12/08/2260312.html#2265337</link><dc:creator>yuronglong</dc:creator><author>yuronglong</author><pubDate>Thu, 08 Dec 2011 13:07:50 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/12/08/2260312.html#2265337</guid><description><![CDATA[忘了语法高亮了
[code=cpp]
#include &lt;iostream&gt;
using namespace std;
int main()
{
    int a[101];
    int temp,flag=0,tmp;
    a[0]=0;
    for(int i=1;i&lt;=100;i++)
    {
        cin&gt;&gt;a[i];
    }
    for(int i=1;i&lt;=100;i++)
    {
        if(flag==2)
        {
            a[temp]=a[i-1];
            a[i-1]=tmp;
            break;
        }
        if((a[i]&gt;a[i+1])||(a[i]&lt;a[i-1]))
        {
            tmp=a[i];
            temp=i;
            flag++;
        }
    }
    for(int i=1;i&lt;=100;i++)cout&lt;&lt;a[i]&lt;&lt;&quot;  &quot;;
    cout&lt;&lt;&quot;\n&quot;;
    system(&quot;pause&quot;);
    return 0;
}
[/code]<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">yuronglong</a> 2011-12-08 21:07 <a href="http://www.cnblogs.com/kkun/archive/2011/12/08/2260312.html#2265337#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2011/12/08/2260312.html#2265336</link><dc:creator>yuronglong</dc:creator><author>yuronglong</author><pubDate>Thu, 08 Dec 2011 13:06:37 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/12/08/2260312.html#2265336</guid><description><![CDATA[#include &lt;iostream&gt;
using namespace std;
int main()
{
    int a[101];
    int temp,flag=0,tmp;
    a[0]=0;
    for(int i=1;i&lt;=100;i++)
    {
        cin&gt;&gt;a[i];
    }
    for(int i=1;i&lt;=100;i++)
    {
        if(flag==2)
        {
            a[temp]=a[i-1];
            a[i-1]=tmp;
            break;
        }
        if((a[i]&gt;a[i+1])||(a[i]&lt;a[i-1]))
        {
            tmp=a[i];
            temp=i;
            flag++;
        }
    }
    for(int i=1;i&lt;=100;i++)cout&lt;&lt;a[i]&lt;&lt;&quot;  &quot;;
    cout&lt;&lt;&quot;\n&quot;;
    system(&quot;pause&quot;);
    return 0;
}<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">yuronglong</a> 2011-12-08 21:06 <a href="http://www.cnblogs.com/kkun/archive/2011/12/08/2260312.html#2265336#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2011/12/08/2260312.html#2264937</link><dc:creator>天边芳草</dc:creator><author>天边芳草</author><pubDate>Thu, 08 Dec 2011 05:48:41 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/12/08/2260312.html#2264937</guid><description><![CDATA[支持一下<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">天边芳草</a> 2011-12-08 13:48 <a href="http://www.cnblogs.com/kkun/archive/2011/12/08/2260312.html#2264937#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:我有一个梦想 I Have a Dream</title><link>http://www.cnblogs.com/kkun/archive/2011/12/06/2222500.html#2263555</link><dc:creator>TinyTian</dc:creator><author>TinyTian</author><pubDate>Tue, 06 Dec 2011 14:30:10 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/12/06/2222500.html#2263555</guid><description><![CDATA[你要设计永动机么？？<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">TinyTian</a> 2011-12-06 22:30 <a href="http://www.cnblogs.com/kkun/archive/2011/12/06/2222500.html#2263555#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 计数排序Counting sort</title><link>http://www.cnblogs.com/kkun/archive/2011/12/05/2260299.html#2262449</link><dc:creator>陈梓瀚(vczh)</dc:creator><author>陈梓瀚(vczh)</author><pubDate>Mon, 05 Dec 2011 15:37:30 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/12/05/2260299.html#2262449</guid><description><![CDATA[为什么我怎么读那段文字都觉得是O(n2)<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">陈梓瀚(vczh)</a> 2011-12-05 23:37 <a href="http://www.cnblogs.com/kkun/archive/2011/12/05/2260299.html#2262449#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 桶排序Bucket sort</title><link>http://www.cnblogs.com/kkun/archive/2011/11/29/2260267.html#2256285</link><dc:creator>kkun</dc:creator><author>kkun</author><pubDate>Tue, 29 Nov 2011 04:59:09 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/29/2260267.html#2256285</guid><description><![CDATA[谢谢,已更正<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">kkun</a> 2011-11-29 12:59 <a href="http://www.cnblogs.com/kkun/archive/2011/11/29/2260267.html#2256285#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 桶排序Bucket sort</title><link>http://www.cnblogs.com/kkun/archive/2011/11/29/2260267.html#2256228</link><dc:creator>porschev</dc:creator><author>porschev</author><pubDate>Tue, 29 Nov 2011 03:43:34 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/29/2260267.html#2256228</guid><description><![CDATA[LZ讲的还是够细，例子就做的不细致了,
你的代码演示一看就知道要报错，数组越界，
你的桶的长度声明的长度为9，而你排序数组中最大的值为9，
buget[unsorted[i]] = unsorted[i]; 这句就会出错，
索引从0开始，你懂的...

修改桶的长度，变成10
var buget = new int[10];<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">porschev</a> 2011-11-29 11:43 <a href="http://www.cnblogs.com/kkun/archive/2011/11/29/2260267.html#2256228#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2011/11/29/2260312.html#2256023</link><dc:creator>parabeyond</dc:creator><author>parabeyond</author><pubDate>Tue, 29 Nov 2011 01:25:12 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/29/2260312.html#2256023</guid><description><![CDATA[[code=csharp]
  int[] list = {1,2,3,4,8,6,7,5,9,10 };
            for (int i = 0; i &lt; list.Length; i++)
            {
                int temp = i + 1;
                if (temp != list[i])
                {
                    temp = list[i];
                    list[i] = list[temp - 1];
                    list[temp - 1] = temp;
                    break;
                }
            }
            foreach (var item in list)
            {
                Console.WriteLine(item);
            }
[/code]<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">parabeyond</a> 2011-11-29 09:25 <a href="http://www.cnblogs.com/kkun/archive/2011/11/29/2260312.html#2256023#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 快速排序Quick sort</title><link>http://www.cnblogs.com/kkun/archive/2011/11/25/2260270.html#2253883</link><dc:creator>kkun</dc:creator><author>kkun</author><pubDate>Fri, 25 Nov 2011 10:22:26 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/25/2260270.html#2253883</guid><description><![CDATA[你写得更详细,谢谢<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">kkun</a> 2011-11-25 18:22 <a href="http://www.cnblogs.com/kkun/archive/2011/11/25/2260270.html#2253883#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 梳排序Comb sort</title><link>http://www.cnblogs.com/kkun/archive/2011/11/25/2260293.html#2253882</link><dc:creator>kkun</dc:creator><author>kkun</author><pubDate>Fri, 25 Nov 2011 10:21:31 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/25/2260293.html#2253882</guid><description><![CDATA[笔误<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">kkun</a> 2011-11-25 18:21 <a href="http://www.cnblogs.com/kkun/archive/2011/11/25/2260293.html#2253882#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 梳排序Comb sort</title><link>http://www.cnblogs.com/kkun/archive/2011/11/25/2260293.html#2253749</link><dc:creator>潇洒一回</dc:creator><author>潇洒一回</author><pubDate>Fri, 25 Nov 2011 08:39:58 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/25/2260293.html#2253749</guid><description><![CDATA[[2 1 3 4 6 5 8 7]
第五次循环,更新距离为1,三处交换

[1 2 3 4 6 5 8 7]
[1 2 3 4 5 6 8 7]
[1 2 3 4 5 6 7 8]<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">潇洒一回</a> 2011-11-25 16:39 <a href="http://www.cnblogs.com/kkun/archive/2011/11/25/2260293.html#2253749#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 快速排序Quick sort</title><link>http://www.cnblogs.com/kkun/archive/2011/11/25/2260270.html#2253728</link><dc:creator>潇洒一回</dc:creator><author>潇洒一回</author><pubDate>Fri, 25 Nov 2011 08:20:53 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/25/2260270.html#2253728</guid><description><![CDATA[1、如无序数组[3 2 4 1 5 9]
[b]a),[/b]先把第一项[3]取出来,
用[3]依次与其余项进行比较,
如果比[3]小就放[3]前边,2  1 都比[3]小,所以全部放到[3]前边
如果比[3]大就放[3]后边,4 5 9比[3]大,放到[3]后边
一趟排完后变成下边这样:
排序前 3 2 4 1 5 9
排序后 2 1 3 4 5 9

[b]b),[/b]对前半拉[2 1]继续进行快速排序
重复步骤a)【取第一项 2与其余项比较】后变成下边这样:
排序前 2 1
排序后 1 2
前半拉排序完成。

[b]c),[/b]对后半拉[4 5 9]继续进行快速排序
重复步骤a)【取第一项 4与其余项比较】后变成下边这样:
排序前 4 5 9
排序后 4 5 9

[b]d),[/b]对后半拉[5 9]继续进行快速排序
重复步骤a)【取第一项 5与其余项比较】后变成下边这样:
排序前 5 9
排序后 5 9
d在这个例子中可以忽略，但是当后面的数字较小时就得必不可少的循环继续下去。



前半拉排序完成。
总的排序也完成:

排序前:[3 2 4 1 5 9]

排序后:[1 2 3 4 5 9]<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">潇洒一回</a> 2011-11-25 16:20 <a href="http://www.cnblogs.com/kkun/archive/2011/11/25/2260270.html#2253728#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2011/11/25/2260312.html#2253697</link><dc:creator>潇洒一回</dc:creator><author>潇洒一回</author><pubDate>Fri, 25 Nov 2011 08:03:47 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/25/2260312.html#2253697</guid><description><![CDATA[看了几个排序，原理讲得很不错。支持下。<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">潇洒一回</a> 2011-11-25 16:03 <a href="http://www.cnblogs.com/kkun/archive/2011/11/25/2260312.html#2253697#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 堆排序Heap sort</title><link>http://www.cnblogs.com/kkun/archive/2011/11/24/2260286.html#2253046</link><dc:creator>谑孩无牙</dc:creator><author>谑孩无牙</author><pubDate>Thu, 24 Nov 2011 14:59:04 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/24/2260286.html#2253046</guid><description><![CDATA[学习！<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">谑孩无牙</a> 2011-11-24 22:59 <a href="http://www.cnblogs.com/kkun/archive/2011/11/24/2260286.html#2253046#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 归并排序Merge sort</title><link>http://www.cnblogs.com/kkun/archive/2011/11/24/2260271.html#2252897</link><dc:creator>kkun</dc:creator><author>kkun</author><pubDate>Thu, 24 Nov 2011 11:51:36 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/24/2260271.html#2252897</guid><description><![CDATA[[quote]天空海阔：
[quote]子数组与女数组合并[/quote]
....[/quote]
子数组与子数组...<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">kkun</a> 2011-11-24 19:51 <a href="http://www.cnblogs.com/kkun/archive/2011/11/24/2260271.html#2252897#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 归并排序</title><link>http://www.cnblogs.com/kkun/archive/2011/11/24/2260271.html#2252852</link><dc:creator>天空海阔</dc:creator><author>天空海阔</author><pubDate>Thu, 24 Nov 2011 10:16:54 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/24/2260271.html#2252852</guid><description><![CDATA[[quote]子数组与女数组合并[/quote]
....<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">天空海阔</a> 2011-11-24 18:16 <a href="http://www.cnblogs.com/kkun/archive/2011/11/24/2260271.html#2252852#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:经典排序算法 - 基数排序</title><link>http://www.cnblogs.com/kkun/archive/2011/11/24/2260275.html#2252572</link><dc:creator>kkun</dc:creator><author>kkun</author><pubDate>Thu, 24 Nov 2011 06:40:46 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/24/2260275.html#2252572</guid><description><![CDATA[[quote]贝加：如果例子中用十位上数字有相等数来说明就更好了[/quote]
没错.回头更新<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">kkun</a> 2011-11-24 14:40 <a href="http://www.cnblogs.com/kkun/archive/2011/11/24/2260275.html#2252572#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2011/11/24/2260312.html#2252472</link><dc:creator>大白糖</dc:creator><author>大白糖</author><pubDate>Thu, 24 Nov 2011 05:15:49 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/24/2260312.html#2252472</guid><description><![CDATA[顶一下,,顺便mark<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">大白糖</a> 2011-11-24 13:15 <a href="http://www.cnblogs.com/kkun/archive/2011/11/24/2260312.html#2252472#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:[经典排序算法][集锦]</title><link>http://www.cnblogs.com/kkun/archive/2011/11/24/2260312.html#2252283</link><dc:creator>贤达</dc:creator><author>贤达</author><pubDate>Thu, 24 Nov 2011 02:00:53 GMT</pubDate><guid>http://www.cnblogs.com/kkun/archive/2011/11/24/2260312.html#2252283</guid><description><![CDATA[[url=http://zh.wikipedia.org/wiki/%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95]http://zh.wikipedia.org/wiki/%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95[/url]<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/kkun/" target="_blank">贤达</a> 2011-11-24 10:00 <a href="http://www.cnblogs.com/kkun/archive/2011/11/24/2260312.html#2252283#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>
