﻿<?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++博客-aurain-随笔分类-算法与数据结构</title><link>http://www.cppblog.com/aurain/category/7285.html</link><description>专注网络编程</description><language>zh-cn</language><lastBuildDate>Wed, 21 Jul 2010 01:06:11 GMT</lastBuildDate><pubDate>Wed, 21 Jul 2010 01:06:11 GMT</pubDate><ttl>60</ttl><item><title>大数据量，海量数据处理方法总结（转） </title><link>http://www.cppblog.com/aurain/archive/2010/07/21/120929.html</link><dc:creator>水</dc:creator><author>水</author><pubDate>Wed, 21 Jul 2010 00:57:00 GMT</pubDate><guid>http://www.cppblog.com/aurain/archive/2010/07/21/120929.html</guid><wfw:comment>http://www.cppblog.com/aurain/comments/120929.html</wfw:comment><comments>http://www.cppblog.com/aurain/archive/2010/07/21/120929.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/aurain/comments/commentRss/120929.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/aurain/services/trackbacks/120929.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 大数据量，海量数据 处理方法总结&nbsp;&nbsp;<a href='http://www.cppblog.com/aurain/archive/2010/07/21/120929.html'>阅读全文</a><img src ="http://www.cppblog.com/aurain/aggbug/120929.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/aurain/" target="_blank">水</a> 2010-07-21 08:57 <a href="http://www.cppblog.com/aurain/archive/2010/07/21/120929.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hash算法大全（转http://www.cppblog.com/koson/archive/2010/03/11/109446.html）</title><link>http://www.cppblog.com/aurain/archive/2010/07/21/120928.html</link><dc:creator>水</dc:creator><author>水</author><pubDate>Wed, 21 Jul 2010 00:54:00 GMT</pubDate><guid>http://www.cppblog.com/aurain/archive/2010/07/21/120928.html</guid><wfw:comment>http://www.cppblog.com/aurain/comments/120928.html</wfw:comment><comments>http://www.cppblog.com/aurain/archive/2010/07/21/120928.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/aurain/comments/commentRss/120928.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/aurain/services/trackbacks/120928.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: hash算法大全&nbsp;&nbsp;<a href='http://www.cppblog.com/aurain/archive/2010/07/21/120928.html'>阅读全文</a><img src ="http://www.cppblog.com/aurain/aggbug/120928.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/aurain/" target="_blank">水</a> 2010-07-21 08:54 <a href="http://www.cppblog.com/aurain/archive/2010/07/21/120928.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>整数划分算法原理与实现</title><link>http://www.cppblog.com/aurain/archive/2008/10/21/64585.html</link><dc:creator>水</dc:creator><author>水</author><pubDate>Tue, 21 Oct 2008 02:29:00 GMT</pubDate><guid>http://www.cppblog.com/aurain/archive/2008/10/21/64585.html</guid><wfw:comment>http://www.cppblog.com/aurain/comments/64585.html</wfw:comment><comments>http://www.cppblog.com/aurain/archive/2008/10/21/64585.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cppblog.com/aurain/comments/commentRss/64585.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/aurain/services/trackbacks/64585.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 整数划分问题是将一个正整数n拆成一组数连加并等于n的形式，且这组数中的最大加数不大于n。将正整数划分成连续的正整数之和，如15可以划分成4种连续整数相加的形式。&nbsp;&nbsp;<a href='http://www.cppblog.com/aurain/archive/2008/10/21/64585.html'>阅读全文</a><img src ="http://www.cppblog.com/aurain/aggbug/64585.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/aurain/" target="_blank">水</a> 2008-10-21 10:29 <a href="http://www.cppblog.com/aurain/archive/2008/10/21/64585.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>求二进制数中1的个数</title><link>http://www.cppblog.com/aurain/archive/2008/10/21/64583.html</link><dc:creator>水</dc:creator><author>水</author><pubDate>Tue, 21 Oct 2008 02:25:00 GMT</pubDate><guid>http://www.cppblog.com/aurain/archive/2008/10/21/64583.html</guid><wfw:comment>http://www.cppblog.com/aurain/comments/64583.html</wfw:comment><comments>http://www.cppblog.com/aurain/archive/2008/10/21/64583.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/aurain/comments/commentRss/64583.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/aurain/services/trackbacks/64583.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 对于一个整形变量，求其二进制表示中“1”的个数。<br><br>扩展问题：给定两个正整数啊a和b，问把a变为b需要改变多少位（bit）？也就是说，整数a和b的二进制表示中有多少位是不同的？<br><br>&nbsp;&nbsp;<a href='http://www.cppblog.com/aurain/archive/2008/10/21/64583.html'>阅读全文</a><img src ="http://www.cppblog.com/aurain/aggbug/64583.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/aurain/" target="_blank">水</a> 2008-10-21 10:25 <a href="http://www.cppblog.com/aurain/archive/2008/10/21/64583.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>计算最大公约数的两种算法</title><link>http://www.cppblog.com/aurain/archive/2008/10/08/63480.html</link><dc:creator>水</dc:creator><author>水</author><pubDate>Wed, 08 Oct 2008 08:21:00 GMT</pubDate><guid>http://www.cppblog.com/aurain/archive/2008/10/08/63480.html</guid><wfw:comment>http://www.cppblog.com/aurain/comments/63480.html</wfw:comment><comments>http://www.cppblog.com/aurain/archive/2008/10/08/63480.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/aurain/comments/commentRss/63480.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/aurain/services/trackbacks/63480.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 本文介绍了两种计算两个正整数的最大公约数的算法：<br>1. 欧几里德算法<br>2. Stein算法&nbsp;&nbsp;<a href='http://www.cppblog.com/aurain/archive/2008/10/08/63480.html'>阅读全文</a><img src ="http://www.cppblog.com/aurain/aggbug/63480.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/aurain/" target="_blank">水</a> 2008-10-08 16:21 <a href="http://www.cppblog.com/aurain/archive/2008/10/08/63480.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>用至少三种方法实现1+2+...+n</title><link>http://www.cppblog.com/aurain/archive/2008/09/05/61008.html</link><dc:creator>水</dc:creator><author>水</author><pubDate>Fri, 05 Sep 2008 08:55:00 GMT</pubDate><guid>http://www.cppblog.com/aurain/archive/2008/09/05/61008.html</guid><wfw:comment>http://www.cppblog.com/aurain/comments/61008.html</wfw:comment><comments>http://www.cppblog.com/aurain/archive/2008/09/05/61008.html#Feedback</comments><slash:comments>19</slash:comments><wfw:commentRss>http://www.cppblog.com/aurain/comments/commentRss/61008.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/aurain/services/trackbacks/61008.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 昨天被问到这个问题，我想了下，只想出了三种方法，不知道还有没有其它方法<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/aurain/archive/2008/09/05/61008.html'>阅读全文</a><img src ="http://www.cppblog.com/aurain/aggbug/61008.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/aurain/" target="_blank">水</a> 2008-09-05 16:55 <a href="http://www.cppblog.com/aurain/archive/2008/09/05/61008.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Win32内存相关API</title><link>http://www.cppblog.com/aurain/archive/2008/08/21/59500.html</link><dc:creator>水</dc:creator><author>水</author><pubDate>Thu, 21 Aug 2008 02:12:00 GMT</pubDate><guid>http://www.cppblog.com/aurain/archive/2008/08/21/59500.html</guid><wfw:comment>http://www.cppblog.com/aurain/comments/59500.html</wfw:comment><comments>http://www.cppblog.com/aurain/archive/2008/08/21/59500.html#Feedback</comments><slash:comments>4</slash:comments><wfw:commentRss>http://www.cppblog.com/aurain/comments/commentRss/59500.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/aurain/services/trackbacks/59500.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 在Win32平台下，可以通过如下5组函数来使用内存（申请和释放操作等）&nbsp;&nbsp;<a href='http://www.cppblog.com/aurain/archive/2008/08/21/59500.html'>阅读全文</a><img src ="http://www.cppblog.com/aurain/aggbug/59500.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/aurain/" target="_blank">水</a> 2008-08-21 10:12 <a href="http://www.cppblog.com/aurain/archive/2008/08/21/59500.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>删除首次出现字串</title><link>http://www.cppblog.com/aurain/archive/2008/07/07/55549.html</link><dc:creator>水</dc:creator><author>水</author><pubDate>Mon, 07 Jul 2008 08:29:00 GMT</pubDate><guid>http://www.cppblog.com/aurain/archive/2008/07/07/55549.html</guid><wfw:comment>http://www.cppblog.com/aurain/comments/55549.html</wfw:comment><comments>http://www.cppblog.com/aurain/archive/2008/07/07/55549.html#Feedback</comments><slash:comments>10</slash:comments><wfw:commentRss>http://www.cppblog.com/aurain/comments/commentRss/55549.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/aurain/services/trackbacks/55549.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 删除在源字符串中首次出现的子串&nbsp;&nbsp;<a href='http://www.cppblog.com/aurain/archive/2008/07/07/55549.html'>阅读全文</a><img src ="http://www.cppblog.com/aurain/aggbug/55549.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/aurain/" target="_blank">水</a> 2008-07-07 16:29 <a href="http://www.cppblog.com/aurain/archive/2008/07/07/55549.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>内部排序算法比较</title><link>http://www.cppblog.com/aurain/archive/2008/06/12/52991.html</link><dc:creator>水</dc:creator><author>水</author><pubDate>Thu, 12 Jun 2008 03:03:00 GMT</pubDate><guid>http://www.cppblog.com/aurain/archive/2008/06/12/52991.html</guid><wfw:comment>http://www.cppblog.com/aurain/comments/52991.html</wfw:comment><comments>http://www.cppblog.com/aurain/archive/2008/06/12/52991.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/aurain/comments/commentRss/52991.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/aurain/services/trackbacks/52991.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 排序算法是数据结构学科经典的内容，其中内部排序现有的算法有很多种，究竟各有什么特点呢？本文力图设计实现常用内部排序算法并进行比较。分别为起泡排序，直接插入排序，简单选择排序，快速排序，堆排序，针对关键字的比较次数和移动次数进行测试比较．<br><br>&nbsp;&nbsp;<a href='http://www.cppblog.com/aurain/archive/2008/06/12/52991.html'>阅读全文</a><img src ="http://www.cppblog.com/aurain/aggbug/52991.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/aurain/" target="_blank">水</a> 2008-06-12 11:03 <a href="http://www.cppblog.com/aurain/archive/2008/06/12/52991.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>一个数组，下标从0到n，元素为从0到n的整数。判断其中是否有重复元素</title><link>http://www.cppblog.com/aurain/archive/2008/06/03/51994.html</link><dc:creator>水</dc:creator><author>水</author><pubDate>Tue, 03 Jun 2008 02:51:00 GMT</pubDate><guid>http://www.cppblog.com/aurain/archive/2008/06/03/51994.html</guid><wfw:comment>http://www.cppblog.com/aurain/comments/51994.html</wfw:comment><comments>http://www.cppblog.com/aurain/archive/2008/06/03/51994.html#Feedback</comments><slash:comments>6</slash:comments><wfw:commentRss>http://www.cppblog.com/aurain/comments/commentRss/51994.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/aurain/services/trackbacks/51994.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一个数组，下标从0到n，元素为从0到n的整数。判断其中是否有重复元素&nbsp;&nbsp;<a href='http://www.cppblog.com/aurain/archive/2008/06/03/51994.html'>阅读全文</a><img src ="http://www.cppblog.com/aurain/aggbug/51994.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/aurain/" target="_blank">水</a> 2008-06-03 10:51 <a href="http://www.cppblog.com/aurain/archive/2008/06/03/51994.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>