﻿<?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>博客园-真的有外星人吗？-随笔分类-C/C++</title><link>http://www.cnblogs.com/nokiaguy/category/135889.html</link><description>假如这个世界上只剩下你一个人，当你正坐在屋子里的时候，这时突然响起了敲门声，那么会是谁呢？</description><language>zh-cn</language><lastBuildDate>Mon, 26 May 2008 22:27:22 GMT</lastBuildDate><pubDate>Mon, 26 May 2008 22:27:22 GMT</pubDate><ttl>60</ttl><item><title>如何解决wxFrame的key event不好使的问题。</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201091.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Fri, 16 May 2008 11:39:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201091.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1201091.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201091.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1201091.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1201091.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 用wxWidgets做个程序，弄了一上午，那个wxFrame上的KeyDown事件怎么也不响应。后来找来wxWidgets本身的一个简单例子，一个wxFrame，一个wxButton，当然，还有一个KeyDown事件。说来也奇怪，当我的焦点在button上时，wxFrame上的 KeyDown就好使了，而不在button上时，就不好使了，不知道wxFrame的源码是怎么写的。&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201091.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1201091.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:39 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/16/1201091.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><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>使用wxWidgets for C++从资源文件中静态装载图像</title><link>http://www.cnblogs.com/nokiaguy/archive/2008/05/13/1195638.html</link><dc:creator>银河使者</dc:creator><author>银河使者</author><pubDate>Tue, 13 May 2008 11:23:00 GMT</pubDate><guid>http://www.cnblogs.com/nokiaguy/archive/2008/05/13/1195638.html</guid><wfw:comment>http://www.cnblogs.com/nokiaguy/comments/1195638.html</wfw:comment><comments>http://www.cnblogs.com/nokiaguy/archive/2008/05/13/1195638.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/nokiaguy/comments/commentRss/1195638.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/nokiaguy/services/trackbacks/1195638.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 在wxWidgets中装载图像是非常容易的，但是如果将图像文件和可执行文件放到一起，在发布时只需要发布可执行文件，要实现这种功能，一般可以使用资源文件来解决。在windows下的资源文件的源文件是*.rc，编译后叫*.res。在linux下类似，源文件为*.xrc，编译后叫*.xres。但它们是xml格式的，要装载这种资源文件也得动态进行装载。相当于配置文件。&nbsp;&nbsp;<a href='http://www.cnblogs.com/nokiaguy/archive/2008/05/13/1195638.html'>阅读全文</a><img src ="http://www.cnblogs.com/nokiaguy/aggbug/1195638.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-13 19:23 <a href="http://www.cnblogs.com/nokiaguy/archive/2008/05/13/1195638.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>