📗 -> 11/12:
🎤 Vocab
❗ Unit and Larger Context
Small summary
✒️ -> Scratch Notes
BF
for i=o to 2^n -1 {
set = decode(i)
if (weight(set) < W) {
//kep track of max rov
}
else {
continue
}
}
LCS = Longest common subsequence
S1 = CATING
S2 = ATXXIXG
Longest common subsequence is 4 (ATIG is common)
Opt(n,m) = max # matches/common char btw x1 to xn and y1 to yn
OPT(n,m) = max[
1 + OPT(n-1, m-1), // matching xn=yn
OPT(n-1, m), // ignore xn
OPT(n, m-1), // ignore ym
OPT(n-1, m-1), // ignore both
]
Problems
- Rod_cutting, Knapsack, LCS
- Pretty Printing
🔗 -> Links
Resources
- Put useful links here
Connections
- Link all related words