Edit Distance-Recursive

#1

why the time complexity is 2^(s1.length+s2.length)

#2

hey @RULEREMPIRES
Construction recursion tree. You can find out how the exponential time complexity is.

T(m,n) = T(m-1,n-1) + T(m-1,n) + T(m,n-1) + 1
T(0,n) = n
T(m,0) = m
#3

should it be 3^(s1.length+s2.length)?

#4

3^(s1.length+s2.length)
yes.