<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	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>Computer Cranium &#187; Pseudo-code</title>
	<atom:link href="http://computercranium.com/category/programming/pseudo-code/feed" rel="self" type="application/rss+xml" />
	<link>http://computercranium.com</link>
	<description>Your Computer Science Resource</description>
	<lastBuildDate>Fri, 23 Jul 2010 01:15:39 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Doubly Linked List &#8211; Delete Middle Without Counting</title>
		<link>http://computercranium.com/cs101/doubly-linked-list-delete-middle-without-counting</link>
		<comments>http://computercranium.com/cs101/doubly-linked-list-delete-middle-without-counting#comments</comments>
		<pubDate>Sun, 28 Dec 2008 22:28:15 +0000</pubDate>
		<dc:creator>Kurt</dc:creator>
				<category><![CDATA[CS 101]]></category>
		<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Pseudo-code]]></category>
		<category><![CDATA[delete middle]]></category>
		<category><![CDATA[doubly linked list]]></category>
		<category><![CDATA[linked list]]></category>

		<guid isPermaLink="false">http://computercranium.com/?p=148</guid>
		<description><![CDATA[The middle of a list is one record with equal number of records to the left and right (assuming the list has odd number of elements). If this number is even, the middle consists of two records. Write a pseudo-code procedure to delete the middle (one or two) record(s) of a doubly linked list without [...]]]></description>
		<wfw:commentRss>http://computercranium.com/cs101/doubly-linked-list-delete-middle-without-counting/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Reverse a Doubly Linked List</title>
		<link>http://computercranium.com/cs101/reverse-a-doubly-linked-list</link>
		<comments>http://computercranium.com/cs101/reverse-a-doubly-linked-list#comments</comments>
		<pubDate>Sun, 28 Dec 2008 21:53:37 +0000</pubDate>
		<dc:creator>Kurt</dc:creator>
				<category><![CDATA[CS 101]]></category>
		<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Pseudo-code]]></category>

		<guid isPermaLink="false">http://computercranium.com/?p=134</guid>
		<description><![CDATA[This question comes up often in undergraduate CS classes, specifically Data Structures and Algorithms: How do you reverse a doubly linked list? Let&#8217;s find out!  

Instructions

Let list be a doubly linked list with a header head and a tail tail. Each record has 3 fields: llink, data, rlink, where the two links give the [...]]]></description>
		<wfw:commentRss>http://computercranium.com/cs101/reverse-a-doubly-linked-list/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
