<?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 on: C++ Program for QUICK SORT</title>
	<atom:link href="http://arunmvishnu.com/programming/c-and-c/c-program-for-quick-sort.html/feed" rel="self" type="application/rss+xml" />
	<link>http://arunmvishnu.com/programming/c-and-c/c-program-for-quick-sort.html</link>
	<description>itz all about me, my works, my views, my feelings …. all my bla bla blas</description>
	<lastBuildDate>Wed, 16 Nov 2011 18:38:03 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
	<item>
		<title>By: jannelle jamandre</title>
		<link>http://arunmvishnu.com/programming/c-and-c/c-program-for-quick-sort.html/comment-page-1#comment-10579</link>
		<dc:creator>jannelle jamandre</dc:creator>
		<pubDate>Tue, 12 Jul 2011 06:35:45 +0000</pubDate>
		<guid isPermaLink="false">http://arunmvishnu.com/?p=605#comment-10579</guid>
		<description>great code.so helpful.</description>
		<content:encoded><![CDATA[<p>great code.so helpful.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: anshul</title>
		<link>http://arunmvishnu.com/programming/c-and-c/c-program-for-quick-sort.html/comment-page-1#comment-8121</link>
		<dc:creator>anshul</dc:creator>
		<pubDate>Sun, 02 Jan 2011 08:20:15 +0000</pubDate>
		<guid isPermaLink="false">http://arunmvishnu.com/?p=605#comment-8121</guid>
		<description>i just wanna ask u that y u ve given the function prototype               void quickSort(int numbers[], int array_size);
since it is not being used in prog.</description>
		<content:encoded><![CDATA[<p>i just wanna ask u that y u ve given the function prototype               void quickSort(int numbers[], int array_size);<br />
since it is not being used in prog.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Arun Vishnu</title>
		<link>http://arunmvishnu.com/programming/c-and-c/c-program-for-quick-sort.html/comment-page-1#comment-3466</link>
		<dc:creator>Arun Vishnu</dc:creator>
		<pubDate>Wed, 25 Nov 2009 11:09:27 +0000</pubDate>
		<guid isPermaLink="false">http://arunmvishnu.com/?p=605#comment-3466</guid>
		<description>Hii Shilpi,
I am sorry, I didt gt time to go through the code.I am @ office and bsy now.. 
one error is: while (left = pivot) .. condition inside the while lop is
while (left == pivot)</description>
		<content:encoded><![CDATA[<p>Hii Shilpi,<br />
I am sorry, I didt gt time to go through the code.I am @ office and bsy now..<br />
one error is: while (left = pivot) .. condition inside the while lop is<br />
while (left == pivot)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Shilpi Agarwal</title>
		<link>http://arunmvishnu.com/programming/c-and-c/c-program-for-quick-sort.html/comment-page-1#comment-3459</link>
		<dc:creator>Shilpi Agarwal</dc:creator>
		<pubDate>Wed, 25 Nov 2009 07:38:02 +0000</pubDate>
		<guid isPermaLink="false">http://arunmvishnu.com/?p=605#comment-3459</guid>
		<description>Hi.
I need to find out a bug in the partition function of the quick sort in following program but i am not able to find it out.Can you help me.

void partition (int a[ ], int n) {
int pivot = a[0];
left = 0;
right = n-1;
while (left = pivot) right--;
if (left != right)
{
a[left] = a[right];
left++;
}
while (a[left] &lt; pivot) left++;
if (left != right)
{
a[right] = a[left];
right--;
}
}
a[left] = pivot;
}</description>
		<content:encoded><![CDATA[<p>Hi.<br />
I need to find out a bug in the partition function of the quick sort in following program but i am not able to find it out.Can you help me.</p>
<p>void partition (int a[ ], int n) {<br />
int pivot = a[0];<br />
left = 0;<br />
right = n-1;<br />
while (left = pivot) right&#8211;;<br />
if (left != right)<br />
{<br />
a[left] = a[right];<br />
left++;<br />
}<br />
while (a[left] &lt; pivot) left++;<br />
if (left != right)<br />
{<br />
a[right] = a[left];<br />
right&#8211;;<br />
}<br />
}<br />
a[left] = pivot;<br />
}</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Minified using disk: basic (Feed is rejected)
Page Caching using disk: enhanced
Database Caching using disk: basic
Object Caching 340/348 objects using disk: basic

Served from: arunmvishnu.com @ 2011-11-23 21:04:14 -->
