<?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: Extract Longest Non-Decreasing Sequence From Any Sequence</title>
	<atom:link href="http://www.olhovsky.com/2009/11/extract-longest-increasing-sequence-from-any-sequence/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.olhovsky.com/2009/11/extract-longest-increasing-sequence-from-any-sequence/</link>
	<description>Miscellaneous Coding</description>
	<lastBuildDate>Wed, 28 Jul 2010 04:37:04 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: brian</title>
		<link>http://www.olhovsky.com/2009/11/extract-longest-increasing-sequence-from-any-sequence/comment-page-1/#comment-55</link>
		<dc:creator>brian</dc:creator>
		<pubDate>Thu, 08 Jul 2010 15:20:29 +0000</pubDate>
		<guid isPermaLink="false">http://www.olhovsky.com/?p=106#comment-55</guid>
		<description>Nice to know it&#039;s here if I ever need it.  I like the format of the listing too (fixed pitch, alternating shading).</description>
		<content:encoded><![CDATA[<p>Nice to know it&#8217;s here if I ever need it.  I like the format of the listing too (fixed pitch, alternating shading).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: olhovsky</title>
		<link>http://www.olhovsky.com/2009/11/extract-longest-increasing-sequence-from-any-sequence/comment-page-1/#comment-49</link>
		<dc:creator>olhovsky</dc:creator>
		<pubDate>Thu, 13 May 2010 23:29:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.olhovsky.com/?p=106#comment-49</guid>
		<description>Hey someone found a &lt;em&gt;use&lt;/em&gt; for this?! Well, that&#039;s more than I expected when posting it :)</description>
		<content:encoded><![CDATA[<p>Hey someone found a <em>use</em> for this?! Well, that&#8217;s more than I expected when posting it <img src='http://www.olhovsky.com/wp/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: newur</title>
		<link>http://www.olhovsky.com/2009/11/extract-longest-increasing-sequence-from-any-sequence/comment-page-1/#comment-47</link>
		<dc:creator>newur</dc:creator>
		<pubDate>Thu, 06 May 2010 05:25:57 +0000</pubDate>
		<guid isPermaLink="false">http://www.olhovsky.com/?p=106#comment-47</guid>
		<description>Hey,

that was (nearly) excact what i was looking for. Had to write this for univerisity in Java. In the end my resulting code looks MUCH different and is not as fast as yours, but its still okay. Without your example I would have never find a solution (and it took only 3 Hours of try-and-error to understand, how it works ^^)

Thanks for sharing, man. :)</description>
		<content:encoded><![CDATA[<p>Hey,</p>
<p>that was (nearly) excact what i was looking for. Had to write this for univerisity in Java. In the end my resulting code looks MUCH different and is not as fast as yours, but its still okay. Without your example I would have never find a solution (and it took only 3 Hours of try-and-error to understand, how it works ^^)</p>
<p>Thanks for sharing, man. <img src='http://www.olhovsky.com/wp/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: olhovsky</title>
		<link>http://www.olhovsky.com/2009/11/extract-longest-increasing-sequence-from-any-sequence/comment-page-1/#comment-46</link>
		<dc:creator>olhovsky</dc:creator>
		<pubDate>Tue, 20 Apr 2010 06:08:12 +0000</pubDate>
		<guid isPermaLink="false">http://www.olhovsky.com/?p=106#comment-46</guid>
		<description>Can you be a little bit more specific?
E.g., tell me a sequence that this algorithm doesn&#039;t work on.

I have verified this against a few million random strings which were solved using a more brute force approach, so I&#039;d be surprised if there is an error.</description>
		<content:encoded><![CDATA[<p>Can you be a little bit more specific?<br />
E.g., tell me a sequence that this algorithm doesn&#8217;t work on.</p>
<p>I have verified this against a few million random strings which were solved using a more brute force approach, so I&#8217;d be surprised if there is an error.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mac</title>
		<link>http://www.olhovsky.com/2009/11/extract-longest-increasing-sequence-from-any-sequence/comment-page-1/#comment-44</link>
		<dc:creator>Mac</dc:creator>
		<pubDate>Fri, 09 Apr 2010 00:19:01 +0000</pubDate>
		<guid isPermaLink="false">http://www.olhovsky.com/?p=106#comment-44</guid>
		<description>Yo, this shit doesn&#039;t fucking work</description>
		<content:encoded><![CDATA[<p>Yo, this shit doesn&#8217;t fucking work</p>
]]></content:encoded>
	</item>
</channel>
</rss>
