﻿<?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/oosky/category/110.html</link><description>一天一个脚印......
&lt;br&gt;每日一句: &lt;script language="javascript" charset="utf-8" src="http://sl.iciba.com/spdshow.php"&gt;&lt;/script&gt;</description><language>zh-cn</language><lastBuildDate>Tue, 20 May 2008 00:45:16 GMT</lastBuildDate><pubDate>Tue, 20 May 2008 00:45:16 GMT</pubDate><ttl>60</ttl><item><title>KMP算法祥解</title><link>http://www.cppblog.com/oosky/archive/2006/07/06/9486.html</link><dc:creator>任我行</dc:creator><author>任我行</author><pubDate>Thu, 06 Jul 2006 06:02:00 GMT</pubDate><guid>http://www.cppblog.com/oosky/archive/2006/07/06/9486.html</guid><wfw:comment>http://www.cppblog.com/oosky/comments/9486.html</wfw:comment><comments>http://www.cppblog.com/oosky/archive/2006/07/06/9486.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/oosky/comments/commentRss/9486.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/oosky/services/trackbacks/9486.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: KMP算法详解&nbsp;&nbsp;<a href='http://www.cppblog.com/oosky/archive/2006/07/06/9486.html'>阅读全文</a><img src ="http://www.cppblog.com/oosky/aggbug/9486.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/oosky/" target="_blank">任我行</a> 2006-07-06 14:02 <a href="http://www.cppblog.com/oosky/archive/2006/07/06/9486.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>各种排序算法小结- -（转贴）</title><link>http://www.cppblog.com/oosky/archive/2005/10/11/625.html</link><dc:creator>任我行</dc:creator><author>任我行</author><pubDate>Tue, 11 Oct 2005 03:16:00 GMT</pubDate><guid>http://www.cppblog.com/oosky/archive/2005/10/11/625.html</guid><wfw:comment>http://www.cppblog.com/oosky/comments/625.html</wfw:comment><comments>http://www.cppblog.com/oosky/archive/2005/10/11/625.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/oosky/comments/commentRss/625.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/oosky/services/trackbacks/625.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 排序算法是一种基本并且常用的算法。由于实际工作中处理的数量巨大，所以排序算法 对算法本身的速度要求很高。 而一般我们所谓的算法的性能主要是指算法的复杂度，一般用O方法来表示。在后面将 给出详细的说明。&nbsp;&nbsp;<a href='http://www.cppblog.com/oosky/archive/2005/10/11/625.html'>阅读全文</a><img src ="http://www.cppblog.com/oosky/aggbug/625.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/oosky/" target="_blank">任我行</a> 2005-10-11 11:16 <a href="http://www.cppblog.com/oosky/archive/2005/10/11/625.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>