<?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: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/"
	
	>
<channel>
	<title>
	Comments on: 算法技术手册 - 排序 - 快速排序	</title>
	<atom:link href="https://www.coder4.com/archives/2159/feed" rel="self" type="application/rss+xml" />
	<link>https://www.coder4.com/archives/2159</link>
	<description>Keep It Simple and Stupid</description>
	<lastBuildDate>Sun, 24 Mar 2024 06:40:36 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.8.3</generator>
	<item>
		<title>
		By: Teknik Telekomunikasi		</title>
		<link>https://www.coder4.com/archives/2159#comment-14050</link>

		<dc:creator><![CDATA[Teknik Telekomunikasi]]></dc:creator>
		<pubDate>Sun, 24 Mar 2024 06:40:36 +0000</pubDate>
		<guid isPermaLink="false">http://www.coder4.com/?p=2159#comment-14050</guid>

					<description><![CDATA[该算法的时间复杂度是多少？为什么平均情况下是O(nlogn)，最坏情况下是O(n^2)？
&lt;a href=&quot;https://bdpr.telkomuniversity.ac.id/digital-nation-ambassador-dna-kembali-digelar-untuk-tahun-2023-ini.html&quot; rel=&quot;nofollow ugc&quot;&gt;Telkom University&lt;/a&gt;]]></description>
			<content:encoded><![CDATA[<p>该算法的时间复杂度是多少？为什么平均情况下是O(nlogn)，最坏情况下是O(n^2)？<br />
<a href="https://bdpr.telkomuniversity.ac.id/digital-nation-ambassador-dna-kembali-digelar-untuk-tahun-2023-ini.html" rel="nofollow ugc">Telkom University</a></p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
