<?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/"
	
	xmlns:georss="http://www.georss.org/georss"
	xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#"
	
	>
<channel>
	<title>
	Comments on: Building, Unbuilding and Sorting Heaps in C++ with the STL	</title>
	<atom:link href="https://www.fluentcpp.com/2018/03/16/heaps-cpp-stl/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.fluentcpp.com/2018/03/16/heaps-cpp-stl/</link>
	<description>Jonathan Boccara&#039;s blog</description>
	<lastBuildDate>Wed, 22 Aug 2018 11:34:00 +0000</lastBuildDate>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.5.3</generator>
	<item>
		<title>
		By: Jonathan Boccara		</title>
		<link>https://www.fluentcpp.com/2018/03/16/heaps-cpp-stl/#comment-1243</link>

		<dc:creator><![CDATA[Jonathan Boccara]]></dc:creator>
		<pubDate>Wed, 22 Aug 2018 11:34:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=3306#comment-1243</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://www.fluentcpp.com/2018/03/16/heaps-cpp-stl/#comment-1238&quot;&gt;Preethi Kajjam&lt;/a&gt;.

A heap as an array is the concatenation of the rows of the tree (from top to bottom). The elements are not sorted inside of a row, so the result is not a sorted vector.]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://www.fluentcpp.com/2018/03/16/heaps-cpp-stl/#comment-1238">Preethi Kajjam</a>.</p>
<p>A heap as an array is the concatenation of the rows of the tree (from top to bottom). The elements are not sorted inside of a row, so the result is not a sorted vector.</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Preethi Kajjam		</title>
		<link>https://www.fluentcpp.com/2018/03/16/heaps-cpp-stl/#comment-1238</link>

		<dc:creator><![CDATA[Preethi Kajjam]]></dc:creator>
		<pubDate>Tue, 21 Aug 2018 05:58:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=3306#comment-1238</guid>

					<description><![CDATA[&quot;Doing this as many times are as there are elements in the heap ends up with a sorted vector and no more heap.&quot; - Can you please explain why isn&#039;t a sorted vector a heap??]]></description>
			<content:encoded><![CDATA[<p>&#8220;Doing this as many times are as there are elements in the heap ends up with a sorted vector and no more heap.&#8221; &#8211; Can you please explain why isn&#8217;t a sorted vector a heap??</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Rujhan Arora		</title>
		<link>https://www.fluentcpp.com/2018/03/16/heaps-cpp-stl/#comment-1162</link>

		<dc:creator><![CDATA[Rujhan Arora]]></dc:creator>
		<pubDate>Thu, 26 Jul 2018 11:08:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=3306#comment-1162</guid>

					<description><![CDATA[Thank u very much Sir.. More power to u :)]]></description>
			<content:encoded><![CDATA[<p>Thank u very much Sir.. More power to u 🙂</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Sebastian		</title>
		<link>https://www.fluentcpp.com/2018/03/16/heaps-cpp-stl/#comment-878</link>

		<dc:creator><![CDATA[Sebastian]]></dc:creator>
		<pubDate>Fri, 23 Mar 2018 08:43:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=3306#comment-878</guid>

					<description><![CDATA[Hey great video. I am wondering why its complexity is maximum 2*N*log(N). I would expected N*log(N)? Thanks already :)]]></description>
			<content:encoded><![CDATA[<p>Hey great video. I am wondering why its complexity is maximum 2*N*log(N). I would expected N*log(N)? Thanks already 🙂</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Jonathan Boccara		</title>
		<link>https://www.fluentcpp.com/2018/03/16/heaps-cpp-stl/#comment-865</link>

		<dc:creator><![CDATA[Jonathan Boccara]]></dc:creator>
		<pubDate>Fri, 16 Mar 2018 08:42:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=3306#comment-865</guid>

					<description><![CDATA[In reply to &lt;a href=&quot;https://www.fluentcpp.com/2018/03/16/heaps-cpp-stl/#comment-863&quot;&gt;Bartlomiej Filipek&lt;/a&gt;.

Hey, I use Keynote on MacOS to make the animations. Though I&#039;m sure there must be better ways to go about that!]]></description>
			<content:encoded><![CDATA[<p>In reply to <a href="https://www.fluentcpp.com/2018/03/16/heaps-cpp-stl/#comment-863">Bartlomiej Filipek</a>.</p>
<p>Hey, I use Keynote on MacOS to make the animations. Though I&#8217;m sure there must be better ways to go about that!</p>
]]></content:encoded>
		
			</item>
		<item>
		<title>
		By: Bartlomiej Filipek		</title>
		<link>https://www.fluentcpp.com/2018/03/16/heaps-cpp-stl/#comment-863</link>

		<dc:creator><![CDATA[Bartlomiej Filipek]]></dc:creator>
		<pubDate>Fri, 16 Mar 2018 07:19:00 +0000</pubDate>
		<guid isPermaLink="false">https://www.fluentcpp.com/?p=3306#comment-863</guid>

					<description><![CDATA[thanks for describing those algorithms!
BTW: how do you make those nice gif animations?]]></description>
			<content:encoded><![CDATA[<p>thanks for describing those algorithms!<br />
BTW: how do you make those nice gif animations?</p>
]]></content:encoded>
		
			</item>
	</channel>
</rss>
