This question already has an answer here:
- Big O of Recursive Methods 2 answers
How to find the Big O for the following recursive function using the recursive method:
T(n)=(n-1)T(n-1)+(n-1)T(n-2)
This question already has an answer here:
How to find the Big O for the following recursive function using the recursive method:
T(n)=(n-1)T(n-1)+(n-1)T(n-2)
Anyway, I tried to solve this case using the classic recursive relation methodology. It's all about observing if a pattern exists:
Very expensive algorithm (Enemies of computer science are factorial and exponential orders of growth).