<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://wcipeg.com/wiki/index.php?action=history&amp;feed=atom&amp;title=Talk%3ABinary_heap</id>
		<title>Talk:Binary heap - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://wcipeg.com/wiki/index.php?action=history&amp;feed=atom&amp;title=Talk%3ABinary_heap"/>
		<link rel="alternate" type="text/html" href="http://wcipeg.com/wiki/index.php?title=Talk:Binary_heap&amp;action=history"/>
		<updated>2026-04-24T14:15:35Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.25.2</generator>

	<entry>
		<id>http://wcipeg.com/wiki/index.php?title=Talk:Binary_heap&amp;diff=1694&amp;oldid=prev</id>
		<title>Dhruvbird: Created page with &quot;This is the first time I have seen an average case analysis of the binary heap operations, and it is very helpful to know what they are since it shows that in practical real-worl...&quot;</title>
		<link rel="alternate" type="text/html" href="http://wcipeg.com/wiki/index.php?title=Talk:Binary_heap&amp;diff=1694&amp;oldid=prev"/>
				<updated>2012-10-10T14:20:05Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot;This is the first time I have seen an average case analysis of the binary heap operations, and it is very helpful to know what they are since it shows that in practical real-worl...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;This is the first time I have seen an average case analysis of the binary heap operations, and it is very helpful to know what they are since it shows that in practical real-world applications, it is probably better than many other structures mainly because of the low constants involved. Plus, the average case analysis helps analyze the average case running time of other algorithms that use the binary-heap as an auxiliary data structure.&lt;/div&gt;</summary>
		<author><name>Dhruvbird</name></author>	</entry>

	</feed>