a) Find the longest common subsequent of these two strings using dynamic programming. Draw the table and the formula.
dbdcba
dbbca
b) Explain master's theorem and all its cases. Then, find the order of these recurrence relationships.
1. T(n) = 2nT(n/2) + nn
2. T(n) = 7T(n/3) + n2
Please give an upvote if you liked my solution. Thank you :)
Get Answers For Free
Most questions answered within 1 hours.