﻿<?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++博客-身上无钱你莫邪</title><link>http://www.cppblog.com/moye/</link><description>moye's c++ blog</description><language>zh-cn</language><lastBuildDate>Thu, 09 Apr 2026 03:43:11 GMT</lastBuildDate><pubDate>Thu, 09 Apr 2026 03:43:11 GMT</pubDate><ttl>60</ttl><item><title>基于模板泛型的冒泡排序算法</title><link>http://www.cppblog.com/moye/archive/2009/02/27/75060.html</link><dc:creator>莫耶</dc:creator><author>莫耶</author><pubDate>Fri, 27 Feb 2009 04:25:00 GMT</pubDate><guid>http://www.cppblog.com/moye/archive/2009/02/27/75060.html</guid><wfw:comment>http://www.cppblog.com/moye/comments/75060.html</wfw:comment><comments>http://www.cppblog.com/moye/archive/2009/02/27/75060.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/moye/comments/commentRss/75060.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/moye/services/trackbacks/75060.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 冒泡排序：将被排序的记录数组R[1..n]垂直排列，每个记录R[i]看作是重量为R[i].key的气泡。根据轻气泡不能在重气泡之下的原则，从下往上扫描数组R：凡扫描到违反本原则的轻气泡，就使其向上"飘浮"。如此反复进行，直到最后任何两个气泡都是轻者在上，重者在下为止。<br><br>此处只针对vector<T>进行冒泡<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/moye/archive/2009/02/27/75060.html'>阅读全文</a><img src ="http://www.cppblog.com/moye/aggbug/75060.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/moye/" target="_blank">莫耶</a> 2009-02-27 12:25 <a href="http://www.cppblog.com/moye/archive/2009/02/27/75060.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>C++ Primer习题：字符串动态修改练习</title><link>http://www.cppblog.com/moye/archive/2009/02/26/74995.html</link><dc:creator>莫耶</dc:creator><author>莫耶</author><pubDate>Thu, 26 Feb 2009 09:24:00 GMT</pubDate><guid>http://www.cppblog.com/moye/archive/2009/02/26/74995.html</guid><wfw:comment>http://www.cppblog.com/moye/comments/74995.html</wfw:comment><comments>http://www.cppblog.com/moye/archive/2009/02/26/74995.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/moye/comments/commentRss/74995.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/moye/services/trackbacks/74995.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 习题3.10 编一个程序，从string对象中去掉标点符号。要求输入程序的字符串必须含有标点符号，输出结果则是去掉标点符号后的string对象。<br>方法1，很笨，先判断string是否有标点，没有就循环。随后再做一个循环，滤掉标点符号，目的不出于这种不合理的做法，而是实验一下iterator对于动态增删改string字符成员的功能<br>办法2，合理的做法，在判断是否含有标点时，就将句子内容滤掉标点记录下来：&nbsp;&nbsp;<a href='http://www.cppblog.com/moye/archive/2009/02/26/74995.html'>阅读全文</a><img src ="http://www.cppblog.com/moye/aggbug/74995.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/moye/" target="_blank">莫耶</a> 2009-02-26 17:24 <a href="http://www.cppblog.com/moye/archive/2009/02/26/74995.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>习题12.1 多态及文本读入</title><link>http://www.cppblog.com/moye/archive/2009/02/03/72869.html</link><dc:creator>莫耶</dc:creator><author>莫耶</author><pubDate>Tue, 03 Feb 2009 04:12:00 GMT</pubDate><guid>http://www.cppblog.com/moye/archive/2009/02/03/72869.html</guid><wfw:comment>http://www.cppblog.com/moye/comments/72869.html</wfw:comment><comments>http://www.cppblog.com/moye/archive/2009/02/03/72869.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/moye/comments/commentRss/72869.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/moye/services/trackbacks/72869.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 使用Account类、Savings类、Checking类及AccountList类，编写一个应用程序，它从文件account.txt中读入一些帐户号和对应的存款额，创建若干个Savings和Checking帐户，直到遇到一个结束标志“x 0”，并输出所有帐户号的存款数据。&nbsp;&nbsp;<a href='http://www.cppblog.com/moye/archive/2009/02/03/72869.html'>阅读全文</a><img src ="http://www.cppblog.com/moye/aggbug/72869.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/moye/" target="_blank">莫耶</a> 2009-02-03 12:12 <a href="http://www.cppblog.com/moye/archive/2009/02/03/72869.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>[转] Effective STL条款31 理解你的排序操作</title><link>http://www.cppblog.com/moye/archive/2008/12/24/70258.html</link><dc:creator>莫耶</dc:creator><author>莫耶</author><pubDate>Wed, 24 Dec 2008 09:53:00 GMT</pubDate><guid>http://www.cppblog.com/moye/archive/2008/12/24/70258.html</guid><wfw:comment>http://www.cppblog.com/moye/comments/70258.html</wfw:comment><comments>http://www.cppblog.com/moye/archive/2008/12/24/70258.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/moye/comments/commentRss/70258.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/moye/services/trackbacks/70258.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 原文：http://stl.winterxy.com/html/000026.html<br>作者： winter <br><br>排序一直是数据结构中的常用算法，STL提供的排序算法非常丰富，如何有效使用就值得探讨。在网上没有找到条款31的翻译，于是我自己翻译了。－－Winter&nbsp;&nbsp;<a href='http://www.cppblog.com/moye/archive/2008/12/24/70258.html'>阅读全文</a><img src ="http://www.cppblog.com/moye/aggbug/70258.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/moye/" target="_blank">莫耶</a> 2008-12-24 17:53 <a href="http://www.cppblog.com/moye/archive/2008/12/24/70258.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>C++求解队形编号</title><link>http://www.cppblog.com/moye/archive/2008/12/20/69923.html</link><dc:creator>莫耶</dc:creator><author>莫耶</author><pubDate>Sat, 20 Dec 2008 12:13:00 GMT</pubDate><guid>http://www.cppblog.com/moye/archive/2008/12/20/69923.html</guid><wfw:comment>http://www.cppblog.com/moye/comments/69923.html</wfw:comment><comments>http://www.cppblog.com/moye/archive/2008/12/20/69923.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/moye/comments/commentRss/69923.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/moye/services/trackbacks/69923.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 其中梅花桩队形的行数或列数没有偶数情形。<br>无论哪种队型，都请你能迅速指出某个编号的队员在队列中的行列号。因为领导和裁判们在台上需要及时了解每个队员的表现，将编号与具体队员对应便可以准确地奖优罚差。显然这是一个光荣而不怎么艰巨的任务，请你一定要把握啊！<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/moye/archive/2008/12/20/69923.html'>阅读全文</a><img src ="http://www.cppblog.com/moye/aggbug/69923.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/moye/" target="_blank">莫耶</a> 2008-12-20 20:13 <a href="http://www.cppblog.com/moye/archive/2008/12/20/69923.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>C++求解数串中第N位数字表示</title><link>http://www.cppblog.com/moye/archive/2008/12/19/69826.html</link><dc:creator>莫耶</dc:creator><author>莫耶</author><pubDate>Fri, 19 Dec 2008 05:36:00 GMT</pubDate><guid>http://www.cppblog.com/moye/archive/2008/12/19/69826.html</guid><wfw:comment>http://www.cppblog.com/moye/comments/69826.html</wfw:comment><comments>http://www.cppblog.com/moye/archive/2008/12/19/69826.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/moye/comments/commentRss/69826.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/moye/services/trackbacks/69826.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: /*有一个无穷数列，其通项表示为：An=10n   n=0,1,2……<br>		构成1,10,100,1000,……，把它连起来，就成了数串1 10 100 1000 10000……<br>		问题：求这数串的第i位是0还是1。	*/&nbsp;&nbsp;<a href='http://www.cppblog.com/moye/archive/2008/12/19/69826.html'>阅读全文</a><img src ="http://www.cppblog.com/moye/aggbug/69826.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/moye/" target="_blank">莫耶</a> 2008-12-19 13:36 <a href="http://www.cppblog.com/moye/archive/2008/12/19/69826.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>c++ 位集计算素数法</title><link>http://www.cppblog.com/moye/archive/2008/12/18/69715.html</link><dc:creator>莫耶</dc:creator><author>莫耶</author><pubDate>Thu, 18 Dec 2008 02:39:00 GMT</pubDate><guid>http://www.cppblog.com/moye/archive/2008/12/18/69715.html</guid><wfw:comment>http://www.cppblog.com/moye/comments/69715.html</wfw:comment><comments>http://www.cppblog.com/moye/archive/2008/12/18/69715.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/moye/comments/commentRss/69715.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/moye/services/trackbacks/69715.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 位集(bitset)计算是用空间换时间&nbsp;&nbsp;<a href='http://www.cppblog.com/moye/archive/2008/12/18/69715.html'>阅读全文</a><img src ="http://www.cppblog.com/moye/aggbug/69715.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/moye/" target="_blank">莫耶</a> 2008-12-18 10:39 <a href="http://www.cppblog.com/moye/archive/2008/12/18/69715.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>c++求Fiobonacci数列的算法效率比较</title><link>http://www.cppblog.com/moye/archive/2008/12/16/69593.html</link><dc:creator>莫耶</dc:creator><author>莫耶</author><pubDate>Tue, 16 Dec 2008 10:38:00 GMT</pubDate><guid>http://www.cppblog.com/moye/archive/2008/12/16/69593.html</guid><wfw:comment>http://www.cppblog.com/moye/comments/69593.html</wfw:comment><comments>http://www.cppblog.com/moye/archive/2008/12/16/69593.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/moye/comments/commentRss/69593.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/moye/services/trackbacks/69593.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 算法决定了性能，看两个关于Fibonacci数列的算法，分别用递归和数学公式计算数列：&nbsp;&nbsp;<a href='http://www.cppblog.com/moye/archive/2008/12/16/69593.html'>阅读全文</a><img src ="http://www.cppblog.com/moye/aggbug/69593.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/moye/" target="_blank">莫耶</a> 2008-12-16 18:38 <a href="http://www.cppblog.com/moye/archive/2008/12/16/69593.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>C++求最大公约数及冒泡排序</title><link>http://www.cppblog.com/moye/archive/2008/12/16/69558.html</link><dc:creator>莫耶</dc:creator><author>莫耶</author><pubDate>Tue, 16 Dec 2008 03:31:00 GMT</pubDate><guid>http://www.cppblog.com/moye/archive/2008/12/16/69558.html</guid><wfw:comment>http://www.cppblog.com/moye/comments/69558.html</wfw:comment><comments>http://www.cppblog.com/moye/archive/2008/12/16/69558.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/moye/comments/commentRss/69558.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/moye/services/trackbacks/69558.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 有一个文件abc.txt，其中含有一些整数对，求出这些整数对的最大公约数，并对这些最大公约数按从小到大的顺序排序输出。&nbsp;&nbsp;<a href='http://www.cppblog.com/moye/archive/2008/12/16/69558.html'>阅读全文</a><img src ="http://www.cppblog.com/moye/aggbug/69558.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/moye/" target="_blank">莫耶</a> 2008-12-16 11:31 <a href="http://www.cppblog.com/moye/archive/2008/12/16/69558.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>C++求阶乘习题</title><link>http://www.cppblog.com/moye/archive/2008/12/12/69269.html</link><dc:creator>莫耶</dc:creator><author>莫耶</author><pubDate>Fri, 12 Dec 2008 05:53:00 GMT</pubDate><guid>http://www.cppblog.com/moye/archive/2008/12/12/69269.html</guid><wfw:comment>http://www.cppblog.com/moye/comments/69269.html</wfw:comment><comments>http://www.cppblog.com/moye/archive/2008/12/12/69269.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/moye/comments/commentRss/69269.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/moye/services/trackbacks/69269.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 今有一个文件abc.txt，内含一些数对，找出全部积为16! 的数对，并输出。&nbsp;&nbsp;<a href='http://www.cppblog.com/moye/archive/2008/12/12/69269.html'>阅读全文</a><img src ="http://www.cppblog.com/moye/aggbug/69269.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/moye/" target="_blank">莫耶</a> 2008-12-12 13:53 <a href="http://www.cppblog.com/moye/archive/2008/12/12/69269.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>