Comments on: Introduction to Dynamic Programming http://20bits.com/articles/introduction-to-dynamic-programming/ Driven by Data Thu, 11 Mar 2010 00:11:01 -0800 http://wordpress.org/?v=2.8.4 hourly 1 By: swapneelpatil http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4876 swapneelpatil Fri, 05 Mar 2010 16:15:25 +0000 http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4876 I always tend to go for recursive functions, as they are easy to debug<br><br># 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 <= i: return s<br> else: return fibo(n, i+1, s+s_1, s)<br><br>print (fibo(10)) I always tend to go for recursive functions, as they are easy to debug

# s: new number in the seq
# s_1: the prev number in the sequence
# i : iterator, which can be eliminated
# if implemented as a local function (like Scheme)
def fibo(n, i=1, s=1, s_1=0):
if n <= i: return s
else: return fibo(n, i+1, s+s_1, s)

print (fibo(10))

]]> By: Jesse Farmer http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4840 Jesse Farmer Sat, 06 Feb 2010 00:03:08 +0000 http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4840 Dynamic Programming is a type of D&C algorithm, but it relies on the existence of overlapping subproblems. Dynamic Programming is a type of D&C algorithm, but it relies on the existence of overlapping subproblems.

]]> By: facebook-100000140332827 http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4835 facebook-100000140332827 Fri, 05 Feb 2010 09:30:45 +0000 http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4835 What is the basic difference between Divide-and-Conquer Technique and Dynamic Programming?? What is the basic difference between Divide-and-Conquer Technique and Dynamic Programming??

]]> By: coderoger http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4520 coderoger Thu, 16 Jul 2009 20:48:28 +0000 http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4520 great post, great post,

]]> By: pickatutorial http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4458 pickatutorial Thu, 25 Jun 2009 15:14:11 +0000 http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4458 Nice work. Keep it up..... Nice work. Keep it up…..

]]> By: biker http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4450 biker Tue, 23 Jun 2009 07:49:53 +0000 http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4450 Superb tutorial..........nice one!!!! Superb tutorial……….nice one!!!!

]]> By: Nilavalagan http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-4324 Nilavalagan Mon, 18 May 2009 04:39:21 +0000 http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-4324 Excellent.. Excellent..

]]> By: james http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-3886 james Sun, 16 Nov 2008 06:55:45 +0000 http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-3886 you should make a function that returns the nth fibonacci number without using recursion. you should make a function that returns the nth fibonacci number without using recursion.

]]> By: Jesse http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-3876 Jesse Sat, 15 Nov 2008 21:53:52 +0000 http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-3876 offo, Sorry for making you work so hard. Do you have any examples of good graphs? Help me learn — don't just berate me. offo,

Sorry for making you work so hard. Do you have any examples of good graphs?

Help me learn — don’t just berate me.

]]> By: SimonTewbi http://20bits.com/articles/introduction-to-dynamic-programming/comment-page-1/#comment-3882 SimonTewbi Sat, 15 Nov 2008 21:33:00 +0000 http://20bits.com/2007/05/08/introduction-to-dynamic-programming/#comment-3882 Come to think of it, I think this might be cleaner:<br><br>def fib2(n):<br> n2, n1 = 0, 1<br> for i in range(n):<br> n2, n1 = n1, n1 + n2<br> return n2 Come to think of it, I think this might be cleaner:

def fib2(n):
n2, n1 = 0, 1
for i in range(n):
n2, n1 = n1, n1 + n2
return n2

]]>