﻿<?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++博客-CodeBeauty</title><link>http://www.cppblog.com/CodeBeauty/</link><description>春暖花开</description><language>zh-cn</language><lastBuildDate>Mon, 06 Apr 2026 04:37:24 GMT</lastBuildDate><pubDate>Mon, 06 Apr 2026 04:37:24 GMT</pubDate><ttl>60</ttl><item><title>鸡尾酒排序（改进的冒泡排序）</title><link>http://www.cppblog.com/CodeBeauty/archive/2012/05/28/176527.html</link><dc:creator>代码之美</dc:creator><author>代码之美</author><pubDate>Mon, 28 May 2012 11:58:00 GMT</pubDate><guid>http://www.cppblog.com/CodeBeauty/archive/2012/05/28/176527.html</guid><wfw:comment>http://www.cppblog.com/CodeBeauty/comments/176527.html</wfw:comment><comments>http://www.cppblog.com/CodeBeauty/archive/2012/05/28/176527.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/CodeBeauty/comments/commentRss/176527.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/CodeBeauty/services/trackbacks/176527.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:  鸡尾酒排序（改进的冒泡排序），原理是对要排序的数组进行双向冒泡排序，双向冒泡排序又称为鸡尾酒排序。&nbsp;&nbsp;<a href='http://www.cppblog.com/CodeBeauty/archive/2012/05/28/176527.html'>阅读全文</a><img src ="http://www.cppblog.com/CodeBeauty/aggbug/176527.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/CodeBeauty/" target="_blank">代码之美</a> 2012-05-28 19:58 <a href="http://www.cppblog.com/CodeBeauty/archive/2012/05/28/176527.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>同时找出最大值和最小值的一种优化算法（比较次数至多为3【n/2】）</title><link>http://www.cppblog.com/CodeBeauty/archive/2012/05/14/174841.html</link><dc:creator>代码之美</dc:creator><author>代码之美</author><pubDate>Mon, 14 May 2012 04:39:00 GMT</pubDate><guid>http://www.cppblog.com/CodeBeauty/archive/2012/05/14/174841.html</guid><wfw:comment>http://www.cppblog.com/CodeBeauty/comments/174841.html</wfw:comment><comments>http://www.cppblog.com/CodeBeauty/archive/2012/05/14/174841.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/CodeBeauty/comments/commentRss/174841.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/CodeBeauty/services/trackbacks/174841.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 但在很多应用中，需同时找到最大值和最小值，一般情况大家较容易想到用上面的算法独立的找到最大值和最小值，各用n-1次，共有2n-2次比较。这在大容量数据库中（n很大），效率不是很高。<br>     在这里，我将给出一种新的算法代码，以大幅提高其效率（n很大时）。具体做法是：每次成对的处理数据，先将一对元素进行比较，然后把较大者与当前最大值比较，较小者与当前最小者比较，因此每两个元素需要3次比较。具体实现时需考虑n的奇偶，n为奇数，3【n/2】次；n为偶数，3n/2-2次。因此总的比较次数至多为3【n-2】。（注：【n】表示不大于n的整数）。&nbsp;&nbsp;<a href='http://www.cppblog.com/CodeBeauty/archive/2012/05/14/174841.html'>阅读全文</a><img src ="http://www.cppblog.com/CodeBeauty/aggbug/174841.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/CodeBeauty/" target="_blank">代码之美</a> 2012-05-14 12:39 <a href="http://www.cppblog.com/CodeBeauty/archive/2012/05/14/174841.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>归并排序MergeSort</title><link>http://www.cppblog.com/CodeBeauty/archive/2012/05/11/174559.html</link><dc:creator>代码之美</dc:creator><author>代码之美</author><pubDate>Fri, 11 May 2012 05:32:00 GMT</pubDate><guid>http://www.cppblog.com/CodeBeauty/archive/2012/05/11/174559.html</guid><wfw:comment>http://www.cppblog.com/CodeBeauty/comments/174559.html</wfw:comment><comments>http://www.cppblog.com/CodeBeauty/archive/2012/05/11/174559.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/CodeBeauty/comments/commentRss/174559.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/CodeBeauty/services/trackbacks/174559.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 归并排序（Merge sort，即合并排序）是建立在归并操作上的一种有效的排序算法。该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。原理通俗 说就是把原始数组分成若干子数组,对每一个子数组进行排序,之后把子数组与子数组合并,合并后仍然有序,直到全部合并完,形成有序的数组。其时间复杂度为O(n)O（最优）、(nlog n)（最差）。&nbsp;&nbsp;<a href='http://www.cppblog.com/CodeBeauty/archive/2012/05/11/174559.html'>阅读全文</a><img src ="http://www.cppblog.com/CodeBeauty/aggbug/174559.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/CodeBeauty/" target="_blank">代码之美</a> 2012-05-11 13:32 <a href="http://www.cppblog.com/CodeBeauty/archive/2012/05/11/174559.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>插入排序InsertionSort</title><link>http://www.cppblog.com/CodeBeauty/archive/2012/05/10/174448.html</link><dc:creator>代码之美</dc:creator><author>代码之美</author><pubDate>Thu, 10 May 2012 04:44:00 GMT</pubDate><guid>http://www.cppblog.com/CodeBeauty/archive/2012/05/10/174448.html</guid><wfw:comment>http://www.cppblog.com/CodeBeauty/comments/174448.html</wfw:comment><comments>http://www.cppblog.com/CodeBeauty/archive/2012/05/10/174448.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/CodeBeauty/comments/commentRss/174448.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/CodeBeauty/services/trackbacks/174448.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:  插入排序就是每一步都将一个待排数据按其大小插入到已经排序的数据中的适当位置，直到全部插入完毕。其时间复杂度为O（n）(最优)、O（n^2）(最差)、O（n^2）(平均)。这是一个对少量元素进行排序的有效算法。&nbsp;&nbsp;<a href='http://www.cppblog.com/CodeBeauty/archive/2012/05/10/174448.html'>阅读全文</a><img src ="http://www.cppblog.com/CodeBeauty/aggbug/174448.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/CodeBeauty/" target="_blank">代码之美</a> 2012-05-10 12:44 <a href="http://www.cppblog.com/CodeBeauty/archive/2012/05/10/174448.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>冒泡排序BubbleSort</title><link>http://www.cppblog.com/CodeBeauty/archive/2012/05/09/174080.html</link><dc:creator>代码之美</dc:creator><author>代码之美</author><pubDate>Wed, 09 May 2012 04:13:00 GMT</pubDate><guid>http://www.cppblog.com/CodeBeauty/archive/2012/05/09/174080.html</guid><wfw:comment>http://www.cppblog.com/CodeBeauty/comments/174080.html</wfw:comment><comments>http://www.cppblog.com/CodeBeauty/archive/2012/05/09/174080.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/CodeBeauty/comments/commentRss/174080.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/CodeBeauty/services/trackbacks/174080.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 冒泡排序是我们接触的最早的排序算法之一，它有着容易理解的优势，时间复杂度为n-1（最优）、n(n-1)/2（最差），由于比较简单，此处只给出我自己编译通过的C++源代码，以供参考。&nbsp;&nbsp;<a href='http://www.cppblog.com/CodeBeauty/archive/2012/05/09/174080.html'>阅读全文</a><img src ="http://www.cppblog.com/CodeBeauty/aggbug/174080.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/CodeBeauty/" target="_blank">代码之美</a> 2012-05-09 12:13 <a href="http://www.cppblog.com/CodeBeauty/archive/2012/05/09/174080.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>计数排序CountSort</title><link>http://www.cppblog.com/CodeBeauty/archive/2012/05/09/174063.html</link><dc:creator>代码之美</dc:creator><author>代码之美</author><pubDate>Wed, 09 May 2012 02:19:00 GMT</pubDate><guid>http://www.cppblog.com/CodeBeauty/archive/2012/05/09/174063.html</guid><wfw:comment>http://www.cppblog.com/CodeBeauty/comments/174063.html</wfw:comment><comments>http://www.cppblog.com/CodeBeauty/archive/2012/05/09/174063.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/CodeBeauty/comments/commentRss/174063.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/CodeBeauty/services/trackbacks/174063.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一共需要三个数组,分别是待排数组nData,票箱数组(计数数组）pCount,和桶数组(存储结果数组)pSort.&nbsp;&nbsp;<a href='http://www.cppblog.com/CodeBeauty/archive/2012/05/09/174063.html'>阅读全文</a><img src ="http://www.cppblog.com/CodeBeauty/aggbug/174063.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/CodeBeauty/" target="_blank">代码之美</a> 2012-05-09 10:19 <a href="http://www.cppblog.com/CodeBeauty/archive/2012/05/09/174063.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>