﻿<?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>博客园-真的有外星人吗？-随笔分类-algorithm</title><link>http://www.cnblogs.com/nokiaguy/category/135618.html</link><description>假如这个世界上只剩下你一个人，当你正坐在屋子里的时候，这时突然响起了敲门声，那么会是谁呢？</description><language>zh-cn</language><lastBuildDate>Fri, 23 May 2008 19:35:09 GMT</lastBuildDate><pubDate>Fri, 23 May 2008 19:35:09 GMT</pubDate><ttl>60</ttl><item><title>数组移动算法算法实现</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201089.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Fri, 16 May 2008 11:37:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201089.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1201089.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201089.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1201089.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1201089.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 对于有n个元素的数组 int a[n]={....};写一个高效算法将数组内容循环左移m位<br>比如： int a[6] ={1,2,3,4,5,6} ,循环左移3位得到结果{456123},<br>要求：<br>1不允许另外申请数组空间，但可以申请少许变量<br>2不允许采用每次左移&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201089.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1201089.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-16 19:37 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201089.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>冒泡排序(bubble sort)算法实现</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201086.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Fri, 16 May 2008 11:34:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201086.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1201086.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201086.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1201086.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1201086.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 冒泡排序是最基本的排序算法，常被做为内部排序的第一个排序算法进行讲解。它的原理非常简单，只是一个两层循环，每次将最大或最小的放到数组最后。&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201086.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1201086.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-16 19:34 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201086.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>插入排序(insertion sort)算法实现</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201081.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Fri, 16 May 2008 11:31:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201081.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1201081.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201081.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1201081.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1201081.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:  插入排序算法的原理很简单，首先将数组的第一个数data[0]看成是有序的，然后从第二个元素开始和它前面的元素进行比较，如果从前面的某一个数大，就交换。由于前面的元素是有序的，所以就使有序元素的个数逐渐增大，直到等于n。插入排序的时间复杂度为O(n^2)。&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201081.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1201081.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-16 19:31 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201081.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>选择排序(selection sort)算法实现</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1200448.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Fri, 16 May 2008 05:20:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1200448.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1200448.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1200448.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1200448.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1200448.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 从字面上理解，就是通过不断地选择数组元素，从而达到排序的目的。我插入排序类似，假设第i(i<n)个数组元素data[0]是最大的(从大到小排序)，然后依次扫描i + 1 到 n - 1的元素，找到比第i个元素大的元素。最后将它们交换。&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1200448.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1200448.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-16 13:20 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1200448.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>希尔排序(shellsort)算法实现</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/15/1199359.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Thu, 15 May 2008 14:00:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/15/1199359.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1199359.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/15/1199359.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1199359.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1199359.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 希尔排序(shellsort)又叫增量递减(diminishing increment)排序，是由D.L. Shell发明的，这个算法是通过一个逐渐减小的增量使一个数组逐渐趋近于有序从而达到排序的目的。&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/15/1199359.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1199359.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-15 22:00 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/15/1199359.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>归并排序(merge sort)算法实现</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/14/1197374.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Wed, 14 May 2008 14:55:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/14/1197374.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1197374.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/14/1197374.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1197374.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1197374.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 归并排序(merge sort)体现了分治的思想，即将一个待排序数组分为两部分，对这两个部分进行归并排序，排序后，再对两个已经排序好的数组进行合并。这种思想可以用递归方式很容易实现。归并排序的时间复杂度为O(nlogn)，空间复杂度为O(n)。&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/14/1197374.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1197374.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-14 22:55 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/14/1197374.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>快速排序(quicksort)算法实现</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/14/1197172.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Wed, 14 May 2008 12:12:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/14/1197172.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1197172.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/14/1197172.html#Feedback</comments><slash:comments>10</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1197172.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1197172.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 快速排序(quicksort)是分治法的典型例子，它的主要思想是将一个待排序的数组以数组的某一个元素X为轴，使这个轴的左侧元素都比X大，而右侧元素都比X小(从大到小排序)。然后以这个X在变换后数组的位置i分为左右两个子数组，再分别进行快速排序，直到子数组中只有一个元素为止。&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/14/1197172.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1197172.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-14 20:12 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/14/1197172.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>得到第K个大的数算法研究</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/12/1193986.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Mon, 12 May 2008 13:05:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/12/1193986.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1193986.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/12/1193986.html#Feedback</comments><slash:comments>17</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1193986.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1193986.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 第一种算法是最容易想到的，就是利用快速排序的思想，将一个数组分成以某一个数X为轴，左边的所有的数都比X小，而右边的数都比X大。但我快速排序不同的是，在这个算法中只考虑X的一边，而不是两边都考虑。 &nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/12/1193986.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1193986.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-12 21:05 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/12/1193986.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>用C#2.0实现网络蜘蛛(WebSpider)</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/12/1193539.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Mon, 12 May 2008 05:20:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/12/1193539.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1193539.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/12/1193539.html#Feedback</comments><slash:comments>21</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1193539.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1193539.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 本文讨论了如何使用C#2.0实现抓取网络资源的网络蜘蛛。使用这个程序，可以通过一个入口网址(如http: //www.comprg.com.cn)来扫描整个互联网的网址，并将这些扫描到的网址所指向的网络资源下载到本地。然后可以利用其他的分析工具对这些网络资源做进一步地分析，如提取关键词、分类索引等。也可以将这些网络资源作为数据源来实现象Google一样的搜索引擎。&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/12/1193539.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1193539.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-12 13:20 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/12/1193539.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>棋盘覆盖问题的算法实现</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192579.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Sun, 11 May 2008 12:39:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192579.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1192579.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192579.html#Feedback</comments><slash:comments>6</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1192579.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1192579.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 在一个2^k * 2^k个方格组成的棋盘中，有一个方格与其它的不同，若使用以下四种L型骨牌覆盖除这个特殊方格的其它方格，如何覆盖。&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192579.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1192579.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-11 20:39 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192579.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>拆半查找的递归和非递归算法</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192569.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Sun, 11 May 2008 12:28:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192569.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1192569.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192569.html#Feedback</comments><slash:comments>11</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1192569.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1192569.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 本文给出了折半查找在递归和非递归实现&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192569.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1192569.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-11 20:28 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192569.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>整数划分算法原理与实现</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192308.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Sun, 11 May 2008 07:39:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192308.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1192308.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192308.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1192308.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1192308.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 整数划分问题是将一个正整数n拆成一组数连加并等于n的形式，且这组数中的最大加数不大于n。&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192308.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1192308.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-11 15:39 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1192308.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>全排列算法原理和实现</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1191914.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Sun, 11 May 2008 01:30:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1191914.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1191914.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1191914.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1191914.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1191914.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 全排列是将一组数按一定顺序进行排列，如果这组数有n个，那么全排列数为n!个。现以{1, 2, 3, 4, 5}为<br>例说明如何编写全排列的递归算法。&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1191914.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1191914.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://nokiaguy.cnblogs.com/" target="_blank">银河使者</a> 2008-05-11 09:30 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/11/1191914.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>