﻿<?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++博客-Fractal Matrix收藏夹-算法</title><link>http://www.cppblog.com/ghtoun/favorite/18071.html</link><description /><language>zh-cn</language><lastBuildDate>Tue, 09 Jun 2026 17:46:38 GMT</lastBuildDate><pubDate>Tue, 09 Jun 2026 17:46:38 GMT</pubDate><ttl>60</ttl><item><title>快排为什么那么快！</title><link>http://mindhacks.cn/2008/06/13/why-is-quicksort-so-quick/</link><dc:creator>Fractal</dc:creator><author>Fractal</author><pubDate>Sat, 05 Nov 2011 07:41:58 GMT</pubDate><guid>http://mindhacks.cn/2008/06/13/why-is-quicksort-so-quick/</guid><description><![CDATA[<a href='http://mindhacks.cn/2008/06/13/why-is-quicksort-so-quick/'>http://mindhacks.cn/2008/06/13/why-is-quicksort-so-quick/</a>]]></description></item></channel></rss>