<?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: Computer Algorithms: Merge Sort</title>
	<atom:link href="/2012/03/05/computer-algorithms-merge-sort/feed/" rel="self" type="application/rss+xml" />
	<link>/2012/03/05/computer-algorithms-merge-sort/</link>
	<description>on web development</description>
	<lastBuildDate>Fri, 26 Oct 2018 21:40:18 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=5.0.3</generator>
	<item>
		<title>By: Kamal</title>
		<link>/2012/03/05/computer-algorithms-merge-sort/comment-page-1/#comment-398416</link>
		<dc:creator><![CDATA[Kamal]]></dc:creator>
		<pubDate>Fri, 26 Feb 2016 07:48:54 +0000</pubDate>
		<guid isPermaLink="false">/?p=2847#comment-398416</guid>
		<description><![CDATA[All your posts are extremely impressive and easy to understand... but here i have one doubt.... 

Worst Case Complexity of Quick Sort  is n(logn) and merge sot it is n*n... which you have written incorrectly... kindly reply and if possible then prove....

Thanks]]></description>
		<content:encoded><![CDATA[<p>All your posts are extremely impressive and easy to understand&#8230; but here i have one doubt&#8230;. </p>
<p>Worst Case Complexity of Quick Sort  is n(logn) and merge sot it is n*n&#8230; which you have written incorrectly&#8230; kindly reply and if possible then prove&#8230;.</p>
<p>Thanks</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: soheila</title>
		<link>/2012/03/05/computer-algorithms-merge-sort/comment-page-1/#comment-18621</link>
		<dc:creator><![CDATA[soheila]]></dc:creator>
		<pubDate>Tue, 16 Apr 2013 18:49:56 +0000</pubDate>
		<guid isPermaLink="false">/?p=2847#comment-18621</guid>
		<description><![CDATA[hello! thank you so much for this typic...
could you help me? I have 1 question:
I need to know how can I write algorithm of merge sort with 3 parts?
In fact in this situation I have 3 arrays and I want to write code of merge sort function of them in c++.
Thanks a lot earlier :)]]></description>
		<content:encoded><![CDATA[<p>hello! thank you so much for this typic&#8230;<br />
could you help me? I have 1 question:<br />
I need to know how can I write algorithm of merge sort with 3 parts?<br />
In fact in this situation I have 3 arrays and I want to write code of merge sort function of them in c++.<br />
Thanks a lot earlier 🙂</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Scooby Doo</title>
		<link>/2012/03/05/computer-algorithms-merge-sort/comment-page-1/#comment-18587</link>
		<dc:creator><![CDATA[Scooby Doo]]></dc:creator>
		<pubDate>Fri, 05 Apr 2013 09:35:21 +0000</pubDate>
		<guid isPermaLink="false">/?p=2847#comment-18587</guid>
		<description><![CDATA[If you added the iterative version too, this would be the the best article on merge sort ever and the only one someone would have to read in order to understand.]]></description>
		<content:encoded><![CDATA[<p>If you added the iterative version too, this would be the the best article on merge sort ever and the only one someone would have to read in order to understand.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Orkut Mahmud</title>
		<link>/2012/03/05/computer-algorithms-merge-sort/comment-page-1/#comment-18517</link>
		<dc:creator><![CDATA[Orkut Mahmud]]></dc:creator>
		<pubDate>Sat, 16 Feb 2013 10:33:20 +0000</pubDate>
		<guid isPermaLink="false">/?p=2847#comment-18517</guid>
		<description><![CDATA[nice post]]></description>
		<content:encoded><![CDATA[<p>nice post</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Chaker Nakhli</title>
		<link>/2012/03/05/computer-algorithms-merge-sort/comment-page-1/#comment-15211</link>
		<dc:creator><![CDATA[Chaker Nakhli]]></dc:creator>
		<pubDate>Wed, 07 Mar 2012 13:17:15 +0000</pubDate>
		<guid isPermaLink="false">/?p=2847#comment-15211</guid>
		<description><![CDATA[Hello,

In this article you only present a recursive version of the merge sort algorithm. An iterative approach is presented here: http://www.javageneration.com/?p=389. It is written in c# but it can be easily converted to Java or any other language.

 Cheers.]]></description>
		<content:encoded><![CDATA[<p>Hello,</p>
<p>In this article you only present a recursive version of the merge sort algorithm. An iterative approach is presented here: <a href="http://www.javageneration.com/?p=389" rel="nofollow">http://www.javageneration.com/?p=389</a>. It is written in c# but it can be easily converted to Java or any other language.</p>
<p> Cheers.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
