<?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: Linear Search in Sorted Lists</title>
	<atom:link href="/2011/12/02/computer-algorithms-linear-search-in-sorted-lists/feed/" rel="self" type="application/rss+xml" />
	<link>/2011/12/02/computer-algorithms-linear-search-in-sorted-lists/</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: Alan S. Balkany</title>
		<link>/2011/12/02/computer-algorithms-linear-search-in-sorted-lists/comment-page-1/#comment-18515</link>
		<dc:creator><![CDATA[Alan S. Balkany]]></dc:creator>
		<pubDate>Thu, 14 Feb 2013 15:27:26 +0000</pubDate>
		<guid isPermaLink="false">/?p=2492#comment-18515</guid>
		<description><![CDATA[Good article.  When frequency of use is taken into account, the best approach may not always be the obvious one.  The same idea is used in Splay Trees (http://en.wikipedia.org/wiki/Splay_tree ) which optimize for frequently-referenced items, but also give logarithmic retrieval times for infrequently used items.]]></description>
		<content:encoded><![CDATA[<p>Good article.  When frequency of use is taken into account, the best approach may not always be the obvious one.  The same idea is used in Splay Trees (<a href="http://en.wikipedia.org/wiki/Splay_tree" rel="nofollow">http://en.wikipedia.org/wiki/Splay_tree</a> ) which optimize for frequently-referenced items, but also give logarithmic retrieval times for infrequently used items.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
