Download presentation
Presentation is loading. Please wait.
1
Knapsack Problem Section 7.6
2
A 8 lbs $7 0.86 B 6 lbs $6 1.00 C 4 lbs $5 1.25 D 2 lbs $3 1.50 E 1 lb $2 2.00 10 lbs capacity A 8 lbs $7 0.86 B 6 lbs $6 1.00 C 4 lbs $5 1.25 D 2 lbs $3 1.50 E 1 lb $2 2.00 A 8 lbs $7 0.86 B 6 lbs $6 1.00 C 4 lbs $5 1.25 D 2 lbs $3 1.50 E 1 lb $2 2.00 By Price By Value or Min Weight =$10
3
A 8 lbs $7 0.86 B 6 lbs $6 1.00 C 4 lbs $5 1.25 D 2 lbs $3 1.50 E 1 lb $2 2.00 10 lbs capacity E D E D E C E B E D E C E D E D E C E B E D E A E D E D E C E * (2 N )
4
A 8 lbs $7 0.86 B 6 lbs $6 1.00 C 4 lbs $5 1.25 D 2 lbs $3 1.50 E 1 lb $2 2.00 10 lbs capacity E D E D E C E B E D E C E D E D E C E B E D E A E D E D E C E * O(2 N )
5
A 8 lbs $7 0.86 B 6 lbs $6 1.00 C 4 lbs $5 1.25 D 2 lbs $3 1.50 E 1 lb $2 2.00 10 lbs capacity BC D E D E C E B E D E A E D E D E C E * O(N K ) on average
6
LCS Problem Longest Common Subsequence Section 8.4
7
E L A I N E S U Z I E A C B A C A B C B A C A B C A A A LCS = ACABC (LENGTH 5) LCS = BACABC (LENGTH 6)
8
a1a1 a2a2 a3a3 b1b1 b2b2 b3b3 a1a1 a2a2 0123233 0123 0123 323 0 a3a3 00 00 23030 0300 00 0
9
a1a1 a2a2 a3a3 b1b1 b2b2 b3b3 a1a1 a2a2 0123233 0123 0123 323 0 a3a3 00 00 23030 0300 00 0
10
a1a1 a2a2 a3a3 b1b1 b2b2 b3b3 a1a1 a2a2 0123233 0123 0123 323 0 a3a3 00 00 23030 0300 00 0
11
a1a1 a2a2 a3a3 b1b1 b2b2 b3b3 a1a1 a2a2 0123233 0123 0123 323 0 a3a3 00 00 23030 0300 00 0
12
a1a1 a2a2 a3a3 b1b1 b2b2 b3b3 a1a1 a2a2 0123233 0123 0123 323 0 a3a3 00 00 23030 0300 00 0
Similar presentations
![LCS Non-Dynamic Version int function lcs (x, y, i, j) begin if (i = 0) or (j = 0) return 0; else if (x[i] = y[j]) return lcs(x, y, i-1, j-1)+1; else return.](/12/3359156/big_thumb.jpg "LCS Non-Dynamic Version int function lcs (x, y, i, j) begin if (i = 0) or (j = 0) return 0; else if (x[i] = y[j]) return lcs(x, y, i-1, j-1)+1; else return.>")
