Diferente pentru blog/square-root-trick intre reviziile #7 si #8
Nu exista diferente intre titluri.
Diferente intre continut:
== code(c) | best[i][j] = longest common sub sequence for A[0:i] and B[0:j], computed as below:
if A[i]\==B[j]:
if A[i] = B[j]:
best[i][j] = 1 + best[i - 1][j - 1] else: best[i][j] = max(best[i-1][j], best[i][j-1])
