<?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; Data Structures &amp; Algorithms</title>
	<atom:link href="http://computercranium.com/category/data-structures-and-algorithms/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>HOW-TO: Use the Levenshtein Distance Algorithm</title>
		<link>http://computercranium.com/programming/java/howto-use-the-levenshtein-distance-algorithm</link>
		<comments>http://computercranium.com/programming/java/howto-use-the-levenshtein-distance-algorithm#comments</comments>
		<pubDate>Thu, 07 May 2009 22:30:21 +0000</pubDate>
		<dc:creator>Kurt</dc:creator>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Tutorials]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[distance]]></category>
		<category><![CDATA[levenshtein]]></category>

		<guid isPermaLink="false">http://computercranium.com/?p=320</guid>
		<description><![CDATA[For an anti-plagiarism application I developed about a year ago, I needed a way to calculate the similarity between two strings.  I wasn&#8217;t sure how to go about doing this at first, but then I came across the Levenshtein Distance Algorithm which gets the job done well.  In this example, I&#8217;ll show you [...]]]></description>
		<wfw:commentRss>http://computercranium.com/programming/java/howto-use-the-levenshtein-distance-algorithm/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>PROJECT: Long Integer ADT</title>
		<link>http://computercranium.com/data-structures-and-algorithms/long-integer-adt</link>
		<comments>http://computercranium.com/data-structures-and-algorithms/long-integer-adt#comments</comments>
		<pubDate>Sun, 04 Jan 2009 06:54:40 +0000</pubDate>
		<dc:creator>Kurt</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Projects]]></category>
		<category><![CDATA[adt]]></category>
		<category><![CDATA[long int]]></category>
		<category><![CDATA[long integer]]></category>
		<category><![CDATA[longint]]></category>

		<guid isPermaLink="false">http://computercranium.com/?p=192</guid>
		<description><![CDATA[Data types in Java and C++ (amongst other languages) are limited to a specified range. Even in most basic calculators, performing an operation with 9 or more digits will result in an error. Sometimes, though, you have to perform very large calculations. Wouldn&#8217;t it be nice if there were an ADT that can perform arbitrary [...]]]></description>
		<wfw:commentRss>http://computercranium.com/data-structures-and-algorithms/long-integer-adt/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<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>
		<item>
		<title>Sorting Algorithms</title>
		<link>http://computercranium.com/programming/java/sorting-algorithms</link>
		<comments>http://computercranium.com/programming/java/sorting-algorithms#comments</comments>
		<pubDate>Sun, 28 Dec 2008 19:40:22 +0000</pubDate>
		<dc:creator>Kurt</dc:creator>
				<category><![CDATA[CS 101]]></category>
		<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[heap sort]]></category>
		<category><![CDATA[merge sort]]></category>
		<category><![CDATA[quick sort]]></category>

		<guid isPermaLink="false">http://computercranium.com/?p=84</guid>
		<description><![CDATA[A while back I had to write a program that would compare different sorting algorithms in Java. The algorithms were Heap Sort, Merge Sort, and Quick Sort.  I will leave the analysis up to you, but I will share the algorithms below.

Heap Sort
Constructor takes an unsorted array and sorts the array for you automatically. [...]]]></description>
		<wfw:commentRss>http://computercranium.com/programming/java/sorting-algorithms/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>PROJECT: Huffman Coding</title>
		<link>http://computercranium.com/data-structures-and-algorithms/huffman-coding</link>
		<comments>http://computercranium.com/data-structures-and-algorithms/huffman-coding#comments</comments>
		<pubDate>Sat, 27 Dec 2008 17:17:36 +0000</pubDate>
		<dc:creator>Kurt</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Projects]]></category>
		<category><![CDATA[compression]]></category>
		<category><![CDATA[huffman]]></category>
		<category><![CDATA[huffman coding]]></category>

		<guid isPermaLink="false">http://computercranium.com/?p=54</guid>
		<description><![CDATA[In the field of computer science, data compression is an extremely important tool used in many different types of applications.  One way to compress data is to convert the data to binary code, using a shorter code for more frequently used values and a longer code for less frequently used values.  Doing so [...]]]></description>
		<wfw:commentRss>http://computercranium.com/data-structures-and-algorithms/huffman-coding/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>PROJECT: LSD Radix Sort</title>
		<link>http://computercranium.com/programming/java/lsd-radix-sort</link>
		<comments>http://computercranium.com/programming/java/lsd-radix-sort#comments</comments>
		<pubDate>Fri, 18 Apr 2008 22:36:00 +0000</pubDate>
		<dc:creator>Kurt</dc:creator>
				<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[Projects]]></category>
		<category><![CDATA[lsd]]></category>
		<category><![CDATA[radix sort]]></category>

		<guid isPermaLink="false">http://computercranium.com/java/lsd-radix-sort</guid>
		<description><![CDATA[I was recently given the task to implement an LSD Radix Sort algorithm to sort a set of strings (a list of names, specifically).  Being that there aren&#8217;t many examples of this online, I&#8217;ve decided to share this.  Admittedly, this took me some time to figure out, but looking back, it&#8217;s really not [...]]]></description>
		<wfw:commentRss>http://computercranium.com/programming/java/lsd-radix-sort/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>PROJECT: Binary Search Tree</title>
		<link>http://computercranium.com/programming/java/binary-search-tree</link>
		<comments>http://computercranium.com/programming/java/binary-search-tree#comments</comments>
		<pubDate>Thu, 20 Mar 2008 17:29:00 +0000</pubDate>
		<dc:creator>Kurt</dc:creator>
				<category><![CDATA[CS 101]]></category>
		<category><![CDATA[Data Structures & Algorithms]]></category>
		<category><![CDATA[Java]]></category>
		<category><![CDATA[Projects]]></category>
		<category><![CDATA[binary search tree]]></category>
		<category><![CDATA[bst]]></category>

		<guid isPermaLink="false">http://computercranium.com/java/binary-search-tree</guid>
		<description><![CDATA[If you&#8217;re a CS student, it&#8217;s only a matter of time before you have to write a program implementing a Binary Search Tree.  Below, I will go through how I would do it, but what makes this version different from most other examples on the Internet is that this one loads a configuration file [...]]]></description>
		<wfw:commentRss>http://computercranium.com/programming/java/binary-search-tree/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
