<?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: Introduction to Dynamic Programming</title>
	<atom:link href="http://20bits.com/articles/introduction-to-dynamic-programming/feed/" rel="self" type="application/rss+xml" />
	<link>http://20bits.com/articles/introduction-to-dynamic-programming/</link>
	<description>Driven by Data</description>
	<lastBuildDate>Wed, 28 Jul 2010 21:50:46 -0700</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: vivek</title>
		<link>http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4997</link>
		<dc:creator>vivek</dc:creator>
		<pubDate>Wed, 12 May 2010 13:10:26 +0000</pubDate>
		<guid isPermaLink="false">http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4997</guid>
		<description>thanks..it helped a lot</description>
		<content:encoded><![CDATA[<p>thanks..it helped a lot</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nelson</title>
		<link>http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4947</link>
		<dc:creator>Nelson</dc:creator>
		<pubDate>Sun, 04 Apr 2010 02:02:47 +0000</pubDate>
		<guid isPermaLink="false">http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4947</guid>
		<description>Again thanks, just thought I might add though that my only feedback would be perhaps writing the example code in a more readable rather than compact way could help. e.g. &lt;br&gt;for i in range(len(a)):&lt;br&gt;        t = t + a[i]&lt;br&gt;        if t &gt; s:&lt;br&gt;            bounds = (j, i+1)&lt;br&gt;            s = t&lt;br&gt;        if t &lt; 0:&lt;br&gt;            t = 0&lt;br&gt;            j = i+1&lt;br&gt;    return (s, bounds)</description>
		<content:encoded><![CDATA[<p>Again thanks, just thought I might add though that my only feedback would be perhaps writing the example code in a more readable rather than compact way could help. e.g. <br />for i in range(len(a)):<br />        t = t + a[i]<br />        if t &gt; s:<br />            bounds = (j, i+1)<br />            s = t<br />        if t &lt; 0:<br />            t = 0<br />            j = i+1<br />    return (s, bounds)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nelson</title>
		<link>http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4939</link>
		<dc:creator>Nelson</dc:creator>
		<pubDate>Sun, 04 Apr 2010 01:33:06 +0000</pubDate>
		<guid isPermaLink="false">http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4939</guid>
		<description>Buddy quit whining over free lollies. This guy&#039;s giving helpful information out for free, if you don&#039;t like it then tough. Eat a dick or something. &lt;br&gt;By the way thanks for the info jesse, I&#039;m trying to get my head around dynamic programming and I appreciate the help.</description>
		<content:encoded><![CDATA[<p>Buddy quit whining over free lollies. This guy&#39;s giving helpful information out for free, if you don&#39;t like it then tough. Eat a dick or something. <br />By the way thanks for the info jesse, I&#39;m trying to get my head around dynamic programming and I appreciate the help.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: swapneelpatil</title>
		<link>http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4876</link>
		<dc:creator>swapneelpatil</dc:creator>
		<pubDate>Fri, 05 Mar 2010 16:15:25 +0000</pubDate>
		<guid isPermaLink="false">http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4876</guid>
		<description>I always tend to go for recursive functions, as they are easy to debug&lt;br&gt;&lt;br&gt;# s: new number in the seq&lt;br&gt;# s_1: the prev number in the sequence&lt;br&gt;# i : iterator, which can be eliminated &lt;br&gt;#     if implemented as a local function (like Scheme)&lt;br&gt;def fibo(n, i=1, s=1, s_1=0):&lt;br&gt;    if n &lt;= i: return s&lt;br&gt;    else: return fibo(n, i+1, s+s_1, s)&lt;br&gt;&lt;br&gt;print (fibo(10))</description>
		<content:encoded><![CDATA[<p>I always tend to go for recursive functions, as they are easy to debug</p>
<p># s: new number in the seq<br /># s_1: the prev number in the sequence<br /># i : iterator, which can be eliminated <br />#     if implemented as a local function (like Scheme)<br />def fibo(n, i=1, s=1, s_1=0):<br />    if n &lt;= i: return s<br />    else: return fibo(n, i+1, s+s_1, s)</p>
<p>print (fibo(10))</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jesse Farmer</title>
		<link>http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4840</link>
		<dc:creator>Jesse Farmer</dc:creator>
		<pubDate>Sat, 06 Feb 2010 00:03:08 +0000</pubDate>
		<guid isPermaLink="false">http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4840</guid>
		<description>Dynamic Programming is a type of D&amp;C algorithm, but it relies on the existence of overlapping subproblems.</description>
		<content:encoded><![CDATA[<p>Dynamic Programming is a type of D&#038;C algorithm, but it relies on the existence of overlapping subproblems.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: facebook-100000140332827</title>
		<link>http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4835</link>
		<dc:creator>facebook-100000140332827</dc:creator>
		<pubDate>Fri, 05 Feb 2010 09:30:45 +0000</pubDate>
		<guid isPermaLink="false">http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4835</guid>
		<description>What is the basic difference between Divide-and-Conquer Technique and Dynamic Programming??</description>
		<content:encoded><![CDATA[<p>What is the basic difference between Divide-and-Conquer Technique and Dynamic Programming??</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: coderoger</title>
		<link>http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4520</link>
		<dc:creator>coderoger</dc:creator>
		<pubDate>Thu, 16 Jul 2009 20:48:28 +0000</pubDate>
		<guid isPermaLink="false">http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4520</guid>
		<description>great post,</description>
		<content:encoded><![CDATA[<p>great post,</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: pickatutorial</title>
		<link>http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4458</link>
		<dc:creator>pickatutorial</dc:creator>
		<pubDate>Thu, 25 Jun 2009 15:14:11 +0000</pubDate>
		<guid isPermaLink="false">http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4458</guid>
		<description>Nice work. Keep it up.....</description>
		<content:encoded><![CDATA[<p>Nice work. Keep it up&#8230;..</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: biker</title>
		<link>http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4450</link>
		<dc:creator>biker</dc:creator>
		<pubDate>Tue, 23 Jun 2009 07:49:53 +0000</pubDate>
		<guid isPermaLink="false">http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4450</guid>
		<description>Superb tutorial..........nice one!!!!</description>
		<content:encoded><![CDATA[<p>Superb tutorial&#8230;&#8230;&#8230;.nice one!!!!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nilavalagan</title>
		<link>http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4324</link>
		<dc:creator>Nilavalagan</dc:creator>
		<pubDate>Mon, 18 May 2009 04:39:21 +0000</pubDate>
		<guid isPermaLink="false">http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4324</guid>
		<description>Excellent..</description>
		<content:encoded><![CDATA[<p>Excellent..</p>
]]></content:encoded>
	</item>
</channel>
</rss>
