hi,

is there a chance there is a mistake in the "ugliness" problem in the presentation ?

I wasn't at class, so I don't understand:

in the formula:

c[1] = lc(1,1), c[j] = min{ c[i-1] + lc(i,j) }

since i<=j, we won't be able to get from c[j] to c[1] by recursion of c[i-1]

shouldn't it be:

c[1] = lc(1,1), c[j] = min{ c[j-1] + lc(i,j) }

so the recursion will compute the smaller problem for c[j-1] and add the "known" price lc(i,j) ?