practice questions

we are given two strings: String S of length n and string T of length m for the LCS problem, we have produced the following exponential time recursive program. LCM (S, n, T, m) { if (n == 0||m == 0) return 0 if (S[n] == T[m]) result t = 1 + LCS ( ... (S, n, T, m - 1)); return result; } then the number of times that LCS (S, 1, T, 1) is recursively called equals ________ plz solve?
we are given two strings: String S of length n and string T of length m for the LCS problem, we have produced the following exponential time recursive program. LCM (S, n, T, m) { if (n == 0||m == 0) return 0 if (S[n] == T[m]) result t = 1 + LCS (S, n - 1, T ... ), LCS (S, n, T, m - 1)); return result; } then the number of times that LCS (S, 1, T, 1) is recursively called equals ________ plz solve?

answered
Jan 18, 2020
in Algorithms
478 views