﻿<?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++博客-进步就是希望-随笔分类-Data Structure</title><link>http://www.cppblog.com/luofeng225/category/6070.html</link><description>学习型博客。</description><language>zh-cn</language><lastBuildDate>Wed, 28 Dec 2011 07:28:17 GMT</lastBuildDate><pubDate>Wed, 28 Dec 2011 07:28:17 GMT</pubDate><ttl>60</ttl><item><title>软件开发的几条原则</title><link>http://www.cppblog.com/luofeng225/archive/2011/12/28/162984.html</link><dc:creator>luofeng</dc:creator><author>luofeng</author><pubDate>Wed, 28 Dec 2011 07:27:00 GMT</pubDate><guid>http://www.cppblog.com/luofeng225/archive/2011/12/28/162984.html</guid><wfw:comment>http://www.cppblog.com/luofeng225/comments/162984.html</wfw:comment><comments>http://www.cppblog.com/luofeng225/archive/2011/12/28/162984.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/luofeng225/comments/commentRss/162984.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/luofeng225/services/trackbacks/162984.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 软件开发的几条原则&nbsp;&nbsp;<a href='http://www.cppblog.com/luofeng225/archive/2011/12/28/162984.html'>阅读全文</a><img src ="http://www.cppblog.com/luofeng225/aggbug/162984.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/luofeng225/" target="_blank">luofeng</a> 2011-12-28 15:27 <a href="http://www.cppblog.com/luofeng225/archive/2011/12/28/162984.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title> 快速排序学习笔记</title><link>http://www.cppblog.com/luofeng225/archive/2008/01/26/41947.html</link><dc:creator>luofeng</dc:creator><author>luofeng</author><pubDate>Sat, 26 Jan 2008 13:12:00 GMT</pubDate><guid>http://www.cppblog.com/luofeng225/archive/2008/01/26/41947.html</guid><wfw:comment>http://www.cppblog.com/luofeng225/comments/41947.html</wfw:comment><comments>http://www.cppblog.com/luofeng225/archive/2008/01/26/41947.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/luofeng225/comments/commentRss/41947.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/luofeng225/services/trackbacks/41947.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:  快速排序&nbsp;&nbsp;<a href='http://www.cppblog.com/luofeng225/archive/2008/01/26/41947.html'>阅读全文</a><img src ="http://www.cppblog.com/luofeng225/aggbug/41947.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/luofeng225/" target="_blank">luofeng</a> 2008-01-26 21:12 <a href="http://www.cppblog.com/luofeng225/archive/2008/01/26/41947.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>冒泡排序学习</title><link>http://www.cppblog.com/luofeng225/archive/2008/01/26/41946.html</link><dc:creator>luofeng</dc:creator><author>luofeng</author><pubDate>Sat, 26 Jan 2008 13:07:00 GMT</pubDate><guid>http://www.cppblog.com/luofeng225/archive/2008/01/26/41946.html</guid><wfw:comment>http://www.cppblog.com/luofeng225/comments/41946.html</wfw:comment><comments>http://www.cppblog.com/luofeng225/archive/2008/01/26/41946.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/luofeng225/comments/commentRss/41946.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/luofeng225/services/trackbacks/41946.html</trackback:ping><description><![CDATA[冒泡排序算法：<br>&nbsp;void BubleSort(SqList &amp;L)<br>&nbsp;{<br>&nbsp; bool exchange;<br>&nbsp; for (int i=2; i&lt;=n; i++)<br>&nbsp; {<br>&nbsp;&nbsp; exchange = false;<br>&nbsp;&nbsp; for (int j=1; j&lt;=n-i+1; j++)<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; if (L.r[j].key&gt;L.r[j+1].key)<br>&nbsp;&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp;&nbsp; exchange = true;<br>&nbsp;&nbsp;&nbsp;&nbsp; L.r[0] = L.r[j+1];<br>&nbsp;&nbsp;&nbsp;&nbsp; L.r[j+1] = L.r[j];<br>&nbsp;&nbsp;&nbsp;&nbsp; L.r[j] = L.r[0];<br>&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp; }<br>&nbsp;&nbsp; if (!exchange)<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; return;<br>&nbsp;&nbsp; }<br>&nbsp; }<br>&nbsp;} 
<img src ="http://www.cppblog.com/luofeng225/aggbug/41946.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/luofeng225/" target="_blank">luofeng</a> 2008-01-26 21:07 <a href="http://www.cppblog.com/luofeng225/archive/2008/01/26/41946.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>