<?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/%E7%B4%A2%E5%BC%95%E9%A1%BA%E5%BA%8F%E8%A1%A8%E6%9F%A5%E6%89%BE/feed" rel="self" type="application/rss+xml" />
	<link>https://www.coder4.com</link>
	<description>Keep It Simple and Stupid</description>
	<lastBuildDate>Sun, 01 Jul 2012 14:28:39 +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/3519</link>
					<comments>https://www.coder4.com/archives/3519#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Sun, 01 Jul 2012 14:28:21 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[二分查找]]></category>
		<category><![CDATA[数据结构]]></category>
		<category><![CDATA[最优查找树]]></category>
		<category><![CDATA[次优查找树]]></category>
		<category><![CDATA[索引顺序表查找]]></category>
		<category><![CDATA[重读]]></category>
		<category><![CDATA[顺序查找]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=3519</guid>

					<description><![CDATA[概念明天补上。。。 顺序查找，用了哨兵，减少检查数组长度的次数，据说这样可以让顺序查找的性能提升一倍。 优点：无序任何假设条件（如数组有序等）。 缺点：效率低。 #include &#60;stdio.h&#62; int ssearch(int* arr, int n, int key) { int i = 0; arr[n] = key; for(i=0;arr[i]!=key;i++); if(i==n) {[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/3519/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
