<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments for The Code Cracker</title>
	<atom:link href="http://thecodecracker.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://thecodecracker.com</link>
	<description>Programming basics</description>
	<lastBuildDate>Mon, 20 Feb 2012 07:35:45 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>Comment on C Program for Circular Linked List by Circular Linked list in C with Append and display options &#124; The Code Cracker</title>
		<link>http://thecodecracker.com/c-programming/circular-linked-list/comment-page-1/#comment-1745</link>
		<dc:creator>Circular Linked list in C with Append and display options &#124; The Code Cracker</dc:creator>
		<pubDate>Mon, 20 Feb 2012 07:35:45 +0000</pubDate>
		<guid isPermaLink="false">http://thecodecracker.com/?p=1133#comment-1745</guid>
		<description>[...] Circular Linked list in C with Append and display options   This is simpler version of Circular linked list program. If you need more options, please check another program http://thecodecracker.com/c-programming/circular-linked-list/. [...]</description>
		<content:encoded><![CDATA[<p>[...] Circular Linked list in C with Append and display options   This is simpler version of Circular linked list program. If you need more options, please check another program <a href="http://thecodecracker.com/c-programming/circular-linked-list/" rel="nofollow">http://thecodecracker.com/c-programming/circular-linked-list/</a>. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on C Program for Circular Linked List by Jishnu</title>
		<link>http://thecodecracker.com/c-programming/circular-linked-list/comment-page-1/#comment-1744</link>
		<dc:creator>Jishnu</dc:creator>
		<pubDate>Mon, 20 Feb 2012 06:50:22 +0000</pubDate>
		<guid isPermaLink="false">http://thecodecracker.com/?p=1133#comment-1744</guid>
		<description>@Sanju Uthaiah,
Thanks, It is my mistake, I didnt check error conditions when I wrote this code.</description>
		<content:encoded><![CDATA[<p>@Sanju Uthaiah,<br />
Thanks, It is my mistake, I didnt check error conditions when I wrote this code.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on String Permutation Using Recursion by Jishnu</title>
		<link>http://thecodecracker.com/c-programming/string-permutation-using-recursion/comment-page-1/#comment-1743</link>
		<dc:creator>Jishnu</dc:creator>
		<pubDate>Mon, 20 Feb 2012 06:45:58 +0000</pubDate>
		<guid isPermaLink="false">http://thecodecracker.com/?p=39#comment-1743</guid>
		<description>@Kyle Hunter
Here, the function &#039;permute&#039; is recursively called to generate all the possible permutations of the string. (If you want to know more about recursion, please check Wikipedia article - &lt;a href=&quot;http://en.wikipedia.org/wiki/Recursion&quot; title=&quot;recusion&quot; target=&quot;_blank&quot; rel=&quot;nofollow&quot;&gt;recursion&lt;/a&gt;. )</description>
		<content:encoded><![CDATA[<p>@Kyle Hunter<br />
Here, the function &#8216;permute&#8217; is recursively called to generate all the possible permutations of the string. (If you want to know more about recursion, please check Wikipedia article &#8211; <a href="http://en.wikipedia.org/wiki/Recursion" title="recusion" target="_blank" rel="nofollow">recursion</a>. )</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Implementation of stack using linked list by Jishnu</title>
		<link>http://thecodecracker.com/c-programming/implementation-of-stack-using-linked-list/comment-page-1/#comment-1742</link>
		<dc:creator>Jishnu</dc:creator>
		<pubDate>Mon, 20 Feb 2012 06:29:26 +0000</pubDate>
		<guid isPermaLink="false">http://thecodecracker.com/?p=21#comment-1742</guid>
		<description>@anamay mishra,
Actually, We don’t need to the MAXSIZE parameter since we are doing dynamic memory allocation.
I mistakenly included the #define value. Now I removed it.</description>
		<content:encoded><![CDATA[<p>@anamay mishra,<br />
Actually, We don’t need to the MAXSIZE parameter since we are doing dynamic memory allocation.<br />
I mistakenly included the #define value. Now I removed it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Implementation of stack using linked list by Jishnu</title>
		<link>http://thecodecracker.com/c-programming/implementation-of-stack-using-linked-list/comment-page-1/#comment-1740</link>
		<dc:creator>Jishnu</dc:creator>
		<pubDate>Mon, 20 Feb 2012 06:26:33 +0000</pubDate>
		<guid isPermaLink="false">http://thecodecracker.com/?p=21#comment-1740</guid>
		<description>@Sasi,
The program is LIFO. I &#039;ve added some comments so that you can understand easily.</description>
		<content:encoded><![CDATA[<p>@Sasi,<br />
The program is LIFO. I &#8216;ve added some comments so that you can understand easily.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Implementation of stack using linked list by anamay mishra</title>
		<link>http://thecodecracker.com/c-programming/implementation-of-stack-using-linked-list/comment-page-1/#comment-1739</link>
		<dc:creator>anamay mishra</dc:creator>
		<pubDate>Mon, 20 Feb 2012 04:25:15 +0000</pubDate>
		<guid isPermaLink="false">http://thecodecracker.com/?p=21#comment-1739</guid>
		<description>code is gud indeed....but the &quot;condition of overflow is missing in push() function..As the max size is 10 what if a person is inserting 11th node.though nodes are dynamically created but it shud check the condition for OVERFLOW.</description>
		<content:encoded><![CDATA[<p>code is gud indeed&#8230;.but the &#8220;condition of overflow is missing in push() function..As the max size is 10 what if a person is inserting 11th node.though nodes are dynamically created but it shud check the condition for OVERFLOW.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on String Permutation Using Recursion by Kyle Hunter</title>
		<link>http://thecodecracker.com/c-programming/string-permutation-using-recursion/comment-page-1/#comment-1738</link>
		<dc:creator>Kyle Hunter</dc:creator>
		<pubDate>Sun, 19 Feb 2012 12:54:30 +0000</pubDate>
		<guid isPermaLink="false">http://thecodecracker.com/?p=39#comment-1738</guid>
		<description>Can you explain the logic in detail?</description>
		<content:encoded><![CDATA[<p>Can you explain the logic in detail?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on implementation of stack using array by tamilselvam</title>
		<link>http://thecodecracker.com/c-programming/implementation-of-stack-using-array/comment-page-1/#comment-1736</link>
		<dc:creator>tamilselvam</dc:creator>
		<pubDate>Sat, 18 Feb 2012 16:18:25 +0000</pubDate>
		<guid isPermaLink="false">http://thecodecracker.com/?p=23#comment-1736</guid>
		<description>While pushing the element also,  the the stacktop variable should point to the newly added value.You have pointed the stacktop variable while popping the element.Plz clarify me .......</description>
		<content:encoded><![CDATA[<p>While pushing the element also,  the the stacktop variable should point to the newly added value.You have pointed the stacktop variable while popping the element.Plz clarify me &#8230;&#8230;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Dining Philosophers Problem by baalki</title>
		<link>http://thecodecracker.com/c-programming/dining-philosophers-problem/comment-page-1/#comment-1731</link>
		<dc:creator>baalki</dc:creator>
		<pubDate>Mon, 13 Feb 2012 14:20:10 +0000</pubDate>
		<guid isPermaLink="false">http://thecodecracker.com/?p=1216#comment-1731</guid>
		<description>thanks boss.....can u get me the code for reader-writer and producer-consumer problem.......</description>
		<content:encoded><![CDATA[<p>thanks boss&#8230;..can u get me the code for reader-writer and producer-consumer problem&#8230;&#8230;.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Message passing through pipe by remya</title>
		<link>http://thecodecracker.com/c-programming/message-passing-through-pipe/comment-page-1/#comment-1730</link>
		<dc:creator>remya</dc:creator>
		<pubDate>Mon, 13 Feb 2012 09:12:32 +0000</pubDate>
		<guid isPermaLink="false">http://thecodecracker.com/?p=1211#comment-1730</guid>
		<description>thanks dear</description>
		<content:encoded><![CDATA[<p>thanks dear</p>
]]></content:encoded>
	</item>
</channel>
</rss>

