<?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"
	>
<channel>
	<title>Comments on: Sorting Algorithms - Heap Sort</title>
	<atom:link href="http://www.openmobilemap.org/20090407/sorting-algorithms-heap-sort/feed" rel="self" type="application/rss+xml" />
	<link>http://www.openmobilemap.org/20090407/sorting-algorithms-heap-sort</link>
	<description>The Free Mobile Map Resources for developers to develop mobile map application on android mobile, java mobile, iphone mobile and ipad tablet</description>
	<pubDate>Sat, 11 Feb 2012 12:50:33 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.3</generator>
		<item>
		<title>By: Search Algorithms - Binary Search&#160;&#124;&#160;Open Mobile Map</title>
		<link>http://www.openmobilemap.org/20090407/sorting-algorithms-heap-sort#comment-426</link>
		<dc:creator>Search Algorithms - Binary Search&#160;&#124;&#160;Open Mobile Map</dc:creator>
		<pubDate>Tue, 07 Apr 2009 10:07:42 +0000</pubDate>
		<guid isPermaLink="false">http://www.openmobilemap.org/?p=255#comment-426</guid>
		<description>[...] Binary search requires an ordered list.  You can use Heap Sort Algorithm to sort the list first.    Iterative Algorithm int find (const apvector &#38;list, double target) [...]</description>
		<content:encoded><![CDATA[<p>[...] Binary search requires an ordered list.  You can use Heap Sort Algorithm to sort the list first.    Iterative Algorithm int find (const apvector &amp;list, double target) [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

