Comments on: Introduction to Dynamic Programming

By: Jeremy Wilson

Jeremy Wilson — Wed, 08 Jun 2011 16:58:00 +0000

> What if all the numbers in the array are negative?

Then the “largest subarray with the maximum sum” will be an array containing just the single “largest” number (i.e. closest to zero). e.g. in the array [-5,-6,-2,-3] the result would be [-2], because it is the largest, and adding anything more to it would make it smaller (more negative). I think his python code works correctly for this case.

By: Anonymous

Anonymous — Wed, 18 May 2011 01:34:00 +0000

Atpresent. on get older. goodness me form welcomes be only a little more low-key. I personally start to wearsophisticated basic color during. on some courtly pandora metallic bracelets . From time to time. I’d would rather pandora charms salepurchase an enormous red-colored hand-bag that i won`teconomic utilization most probably. as well as toss directly towards water closetbecause various years. purchase a manufacturer new neutral-colored ladies handbag pandora bracelets on salepossessing pandora silver valuable metal charms beat would appear more from significance while have the abilitypandora bracelets outlet to pat it it does not create a difference throughout the evening or possibly overnight.

By: chad salvador

chad salvador — Tue, 30 Nov 2010 05:43:30 +0000

is there a ydynamic member in variable if there please give me one

By: Amdkfgi

Amdkfgi — Sun, 28 Nov 2010 16:33:35 +0000

its the tree between my legs, consist of a big banana and two eggs

By: Sarthakgovind

Sarthakgovind — Wed, 27 Oct 2010 10:51:13 +0000

what is definition of optimal binary search tree and its algorithm described?

By: vivek

vivek — Wed, 12 May 2010 13:10:26 +0000

thanks..it helped a lot

By: Nelson

Nelson — Sun, 04 Apr 2010 02:02:47 +0000

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.
for i in range(len(a)):
t = t + a[i]
if t > s:
bounds = (j, i+1)
s = t
if t < 0:
t = 0
j = i+1
return (s, bounds)

By: Nelson

Nelson — Sun, 04 Apr 2010 01:33:06 +0000

Buddy quit whining over free lollies. This guy's giving helpful information out for free, if you don't like it then tough. Eat a dick or something.
By the way thanks for the info jesse, I'm trying to get my head around dynamic programming and I appreciate the help.

By: swapneelpatil

swapneelpatil — Fri, 05 Mar 2010 16:15:25 +0000

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

Jesse Farmer — Sat, 06 Feb 2010 00:03:08 +0000

Dynamic Programming is a type of D&C algorithm, but it relies on the existence of overlapping subproblems.