<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
	>

<channel>
	<title>Encrypt3d</title>
	<atom:link href="http://encrypt3d.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://encrypt3d.wordpress.com</link>
	<description>you have to just decrypt it !</description>
	<lastBuildDate>Sun, 01 May 2011 02:32:03 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='encrypt3d.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>Encrypt3d</title>
		<link>http://encrypt3d.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://encrypt3d.wordpress.com/osd.xml" title="Encrypt3d" />
	<atom:link rel='hub' href='http://encrypt3d.wordpress.com/?pushpress=hub'/>
		<item>
		<title>How to sort a singly linked list?</title>
		<link>http://encrypt3d.wordpress.com/2010/11/06/how-to-sort-a-singly-linked-list/</link>
		<comments>http://encrypt3d.wordpress.com/2010/11/06/how-to-sort-a-singly-linked-list/#comments</comments>
		<pubDate>Sat, 06 Nov 2010 08:28:59 +0000</pubDate>
		<dc:creator>encrypt3d</dc:creator>
				<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Linked List]]></category>

		<guid isPermaLink="false">http://encrypt3d.wordpress.com/?p=303</guid>
		<description><![CDATA[Sorting a singly linked is simple. Find the method below for the same. /* a function to sort a list */ struct node *sortlist(struct node *p) { struct node *temp1,*temp2,*min,*prev,*q; q = NULL; while(p != NULL) { prev = NULL; min = temp1 = p; temp2 = p -&#62; link; while ( temp2 != NULL [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=encrypt3d.wordpress.com&amp;blog=1190852&amp;post=303&amp;subd=encrypt3d&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://encrypt3d.wordpress.com/2010/11/06/how-to-sort-a-singly-linked-list/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/1a0fb451a98b894136fa69b2239c2b20?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">encrypt3d</media:title>
		</media:content>
	</item>
		<item>
		<title>How to insert a node in a sorted linked list?</title>
		<link>http://encrypt3d.wordpress.com/2010/11/06/how-to-insert-a-node-in-a-sorted-linked-list/</link>
		<comments>http://encrypt3d.wordpress.com/2010/11/06/how-to-insert-a-node-in-a-sorted-linked-list/#comments</comments>
		<pubDate>Sat, 06 Nov 2010 08:25:50 +0000</pubDate>
		<dc:creator>encrypt3d</dc:creator>
				<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Linked List]]></category>

		<guid isPermaLink="false">http://encrypt3d.wordpress.com/?p=300</guid>
		<description><![CDATA[To insert a new node into an already sorted list, we compare the data value of the node to be inserted with the data values of the nodes in the list starting from the first node. This is continued until we get a pointer to the node that appears immediately before the node in the [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=encrypt3d.wordpress.com&amp;blog=1190852&amp;post=300&amp;subd=encrypt3d&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://encrypt3d.wordpress.com/2010/11/06/how-to-insert-a-node-in-a-sorted-linked-list/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/1a0fb451a98b894136fa69b2239c2b20?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">encrypt3d</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/11/insert_into_sorted_list.png" medium="image">
			<media:title type="html">insert_into_sorted_list</media:title>
		</media:content>
	</item>
		<item>
		<title>How to insert a node after a specified node in a linked list?</title>
		<link>http://encrypt3d.wordpress.com/2010/10/30/how-to-insert-in-a-node-after-a-specified-node-in-a-linked-list/</link>
		<comments>http://encrypt3d.wordpress.com/2010/10/30/how-to-insert-in-a-node-after-a-specified-node-in-a-linked-list/#comments</comments>
		<pubDate>Sat, 30 Oct 2010 12:08:49 +0000</pubDate>
		<dc:creator>encrypt3d</dc:creator>
				<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Linked List]]></category>

		<guid isPermaLink="false">http://encrypt3d.wordpress.com/?p=295</guid>
		<description><![CDATA[To insert a new node after the specified node in a singly linked list, first we get the number of the node in an existing singly linked list after which the new node is to be inserted. This is based on the assumption that the nodes of the list are numbered serially from 1 to [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=encrypt3d.wordpress.com&amp;blog=1190852&amp;post=295&amp;subd=encrypt3d&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://encrypt3d.wordpress.com/2010/10/30/how-to-insert-in-a-node-after-a-specified-node-in-a-linked-list/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/1a0fb451a98b894136fa69b2239c2b20?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">encrypt3d</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/before_insertion.png" medium="image">
			<media:title type="html">before_insertion</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/after_insertion.png" medium="image">
			<media:title type="html">after_insertion</media:title>
		</media:content>
	</item>
		<item>
		<title>How to insert a node in a linked list recursively?</title>
		<link>http://encrypt3d.wordpress.com/2010/10/30/how-to-insert-a-node-in-a-linked-list-recursively/</link>
		<comments>http://encrypt3d.wordpress.com/2010/10/30/how-to-insert-a-node-in-a-linked-list-recursively/#comments</comments>
		<pubDate>Sat, 30 Oct 2010 11:59:19 +0000</pubDate>
		<dc:creator>encrypt3d</dc:creator>
				<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Linked List]]></category>

		<guid isPermaLink="false">http://encrypt3d.wordpress.com/?p=292</guid>
		<description><![CDATA[A linked list is a recursive data structure. A recursive data structure is a data structure that has the same form regardless of the size of the data. If you haven&#8217;t already gone through the concepts of a linked list, I recommend you to go through my previous article on linked list first. The recursive [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=encrypt3d.wordpress.com&amp;blog=1190852&amp;post=292&amp;subd=encrypt3d&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://encrypt3d.wordpress.com/2010/10/30/how-to-insert-a-node-in-a-linked-list-recursively/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/1a0fb451a98b894136fa69b2239c2b20?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">encrypt3d</media:title>
		</media:content>
	</item>
		<item>
		<title>Deleting a node from doubly linked list</title>
		<link>http://encrypt3d.wordpress.com/2010/10/05/deleting-a-node-from-doubly-linked-list/</link>
		<comments>http://encrypt3d.wordpress.com/2010/10/05/deleting-a-node-from-doubly-linked-list/#comments</comments>
		<pubDate>Tue, 05 Oct 2010 12:47:58 +0000</pubDate>
		<dc:creator>encrypt3d</dc:creator>
				<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Linked List]]></category>

		<guid isPermaLink="false">http://encrypt3d.wordpress.com/?p=288</guid>
		<description><![CDATA[How do you delete a node from doubly linked list? This is basically manipulations of links and freeing the memory for deleted node. If you are not already familiar with concepts of doubly linked lists, I would recommend you go through that first. Deleting a node from doubly linked list. struct dnode * delete( struct [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=encrypt3d.wordpress.com&amp;blog=1190852&amp;post=288&amp;subd=encrypt3d&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://encrypt3d.wordpress.com/2010/10/05/deleting-a-node-from-doubly-linked-list/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/1a0fb451a98b894136fa69b2239c2b20?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">encrypt3d</media:title>
		</media:content>
	</item>
		<item>
		<title>What are Doubly Linked Lists?</title>
		<link>http://encrypt3d.wordpress.com/2010/10/05/what-are-doubly-linked-lists/</link>
		<comments>http://encrypt3d.wordpress.com/2010/10/05/what-are-doubly-linked-lists/#comments</comments>
		<pubDate>Tue, 05 Oct 2010 12:32:54 +0000</pubDate>
		<dc:creator>encrypt3d</dc:creator>
				<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Linked List]]></category>

		<guid isPermaLink="false">http://encrypt3d.wordpress.com/?p=282</guid>
		<description><![CDATA[After reading this article you should be able to answer the following questions. What are doubly linked lists? How doubly linked lists are implemented? What are the applications for doubly linked lists? How doubly linked lists are different than singly-linked lists? Introduction The following are problems with singly linked lists: A singly linked list allows [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=encrypt3d.wordpress.com&amp;blog=1190852&amp;post=282&amp;subd=encrypt3d&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://encrypt3d.wordpress.com/2010/10/05/what-are-doubly-linked-lists/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/1a0fb451a98b894136fa69b2239c2b20?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">encrypt3d</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/doubly_linked_list_1.png" medium="image">
			<media:title type="html">doubly_linked_list_1</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/doubly_linked_list2.png" medium="image">
			<media:title type="html">doubly_linked_list2</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/doubly_linked_list3.png" medium="image">
			<media:title type="html">doubly_linked_list3</media:title>
		</media:content>
	</item>
		<item>
		<title>How to delete a specified node from a Linked List?</title>
		<link>http://encrypt3d.wordpress.com/2010/10/02/how-to-delete-a-specified-node-from-a-linked-list/</link>
		<comments>http://encrypt3d.wordpress.com/2010/10/02/how-to-delete-a-specified-node-from-a-linked-list/#comments</comments>
		<pubDate>Sat, 02 Oct 2010 12:32:00 +0000</pubDate>
		<dc:creator>encrypt3d</dc:creator>
				<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Linked List]]></category>

		<guid isPermaLink="false">http://encrypt3d.wordpress.com/?p=260</guid>
		<description><![CDATA[Deleting a specified node from a linked List To delete a node, first we determine the node number to be deleted (this is based on the assumption that the nodes of the list are numbered serially from 1 to n). The list is then traversed to get a pointer to the node whose number is [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=encrypt3d.wordpress.com&amp;blog=1190852&amp;post=260&amp;subd=encrypt3d&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://encrypt3d.wordpress.com/2010/10/02/how-to-delete-a-specified-node-from-a-linked-list/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/1a0fb451a98b894136fa69b2239c2b20?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">encrypt3d</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/deleteing_a_node_before.png" medium="image">
			<media:title type="html">deleteing_a_node_before</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/deleting_a_node_after.png" medium="image">
			<media:title type="html">deleting_a_node_after</media:title>
		</media:content>
	</item>
		<item>
		<title>Sorting and Reversing a Linked List</title>
		<link>http://encrypt3d.wordpress.com/2010/10/02/sorting-and-reversing-a-linked-list/</link>
		<comments>http://encrypt3d.wordpress.com/2010/10/02/sorting-and-reversing-a-linked-list/#comments</comments>
		<pubDate>Sat, 02 Oct 2010 12:22:57 +0000</pubDate>
		<dc:creator>encrypt3d</dc:creator>
				<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Linked List]]></category>

		<guid isPermaLink="false">http://encrypt3d.wordpress.com/?p=255</guid>
		<description><![CDATA[This article will traverse you through few easy steps to sort a linked list. Linked list needs to be sorted for many applications in computer science.  If you haven&#8217;t already ready my article of basic knowledge for Linked List, I would recommend to go through that first. You may also be interested to check out [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=encrypt3d.wordpress.com&amp;blog=1190852&amp;post=255&amp;subd=encrypt3d&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://encrypt3d.wordpress.com/2010/10/02/sorting-and-reversing-a-linked-list/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/1a0fb451a98b894136fa69b2239c2b20?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">encrypt3d</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/sorting_a_list.png" medium="image">
			<media:title type="html">sorting_a_list</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/sorting_alist_2.png" medium="image">
			<media:title type="html">sorting_alist_2</media:title>
		</media:content>
	</item>
		<item>
		<title>Now its time for Blackberry Playbook</title>
		<link>http://encrypt3d.wordpress.com/2010/10/01/now-its-time-for-blackberry-playbook/</link>
		<comments>http://encrypt3d.wordpress.com/2010/10/01/now-its-time-for-blackberry-playbook/#comments</comments>
		<pubDate>Fri, 01 Oct 2010 11:33:45 +0000</pubDate>
		<dc:creator>encrypt3d</dc:creator>
				<category><![CDATA[General]]></category>

		<guid isPermaLink="false">http://encrypt3d.wordpress.com/?p=238</guid>
		<description><![CDATA[Just after Apple released iPad and has seen a huge success of the product worldwide. The other companies are trying to catch up with tablet products. BlackBerry maker Research In Motion is jumping into the tablet arena with the PlayBook. It will have a 7-inch screen and is designed for both personal and business users. [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=encrypt3d.wordpress.com&amp;blog=1190852&amp;post=238&amp;subd=encrypt3d&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://encrypt3d.wordpress.com/2010/10/01/now-its-time-for-blackberry-playbook/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/1a0fb451a98b894136fa69b2239c2b20?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">encrypt3d</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/blackberry-playbook.jpg" medium="image">
			<media:title type="html">blackberry-playbook</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/bberry-tablet_angle_800-660x495.jpg" medium="image">
			<media:title type="html">bberry-Tablet_angle_800-660x495</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/ipad-playbook.jpg" medium="image">
			<media:title type="html">ipad-playbook</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/playbook-portability.jpg" medium="image">
			<media:title type="html">playbook-portability</media:title>
		</media:content>
	</item>
		<item>
		<title>How to implement a linked list?</title>
		<link>http://encrypt3d.wordpress.com/2010/10/01/how-to-implement-a-linked-list/</link>
		<comments>http://encrypt3d.wordpress.com/2010/10/01/how-to-implement-a-linked-list/#comments</comments>
		<pubDate>Fri, 01 Oct 2010 05:08:00 +0000</pubDate>
		<dc:creator>encrypt3d</dc:creator>
				<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Linked List]]></category>

		<guid isPermaLink="false">http://encrypt3d.wordpress.com/?p=229</guid>
		<description><![CDATA[After reading this article you should be able to answer: What is a linked list? Why do we need a linked list? How to implement a linked list? What is the structure of a linked list node? How to insert a node into a linked list? How to print the existing linked list? THE CONCEPT [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=encrypt3d.wordpress.com&amp;blog=1190852&amp;post=229&amp;subd=encrypt3d&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://encrypt3d.wordpress.com/2010/10/01/how-to-implement-a-linked-list/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
	
		<media:content url="http://1.gravatar.com/avatar/1a0fb451a98b894136fa69b2239c2b20?s=96&#38;d=identicon&#38;r=G" medium="image">
			<media:title type="html">encrypt3d</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/linked_list_linked_list.png" medium="image">
			<media:title type="html">linked_list_linked_list</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/linked_list.png" medium="image">
			<media:title type="html">linked_list</media:title>
		</media:content>

		<media:content url="http://encrypt3d.files.wordpress.com/2010/10/link_list_node.png" medium="image">
			<media:title type="html">link_list_node</media:title>
		</media:content>
	</item>
	</channel>
</rss>
