<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:media="http://search.yahoo.com/mrss/"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>划分 - 四号程序员</title>
	<atom:link href="https://www.coder4.com/archives/tag/%E5%88%92%E5%88%86/feed" rel="self" type="application/rss+xml" />
	<link>https://www.coder4.com</link>
	<description>Keep It Simple and Stupid</description>
	<lastBuildDate>Mon, 17 Oct 2011 09:05:21 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.8.3</generator>
	<item>
		<title>算法技术手册 – 排序 – 划分</title>
		<link>https://www.coder4.com/archives/2148</link>
					<comments>https://www.coder4.com/archives/2148#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Sat, 17 Sep 2011 05:02:58 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[划分]]></category>
		<category><![CDATA[排序]]></category>
		<category><![CDATA[算法技术手册]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=2148</guid>

					<description><![CDATA[划分是求Kth、快速排序等的基础。 目标：一个数组array，给定一个pivotIndex，要求将array[pivotIndex]的对象至于storeIndex位置，使得[left,storeIndex)的元素都小于array[pivotIndex]，而使得大于[storeIndex,right]的元素都大于等于array[pivotIndex]。 算法步骤： 1、交换array[pivotIndex]和array[right]，记前者为pivot 2、用store表示pivo[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/2148/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
