<?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/%E9%9D%9E%E5%BE%AA%E7%8E%AF%E9%A1%BA%E5%BA%8F%E9%98%9F%E5%88%97/feed" rel="self" type="application/rss+xml" />
	<link>https://www.coder4.com</link>
	<description>Keep It Simple and Stupid</description>
	<lastBuildDate>Sat, 26 Dec 2009 06:03:57 +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>《数据结构》读书笔记 第三章 非循环顺序队列2</title>
		<link>https://www.coder4.com/archives/224</link>
					<comments>https://www.coder4.com/archives/224#respond</comments>
		
		<dc:creator><![CDATA[coder4]]></dc:creator>
		<pubDate>Sat, 26 Dec 2009 06:03:57 +0000</pubDate>
				<category><![CDATA[算法&数据结构]]></category>
		<category><![CDATA[递归]]></category>
		<category><![CDATA[非循环顺序队列]]></category>
		<guid isPermaLink="false">http://www.coder4.com/?p=224</guid>

					<description><![CDATA[比起第一个顺序非循环队列，这个是浪费空间，节约时间版本～ Queue.h:定义了队列的基本操作 #include &#60;iostream&#62; enum {OK=0,WRONG=-1}; enum {QIS=10,QI=2}; typedef int Elem; typedef int Status; typedef struct { &#160;Elem *base; &#160;int front; &#160;int rear; &#160;int qsize; }Q[......] 继续阅读]]></description>
		
					<wfw:commentRss>https://www.coder4.com/archives/224/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
