Big O notation using the recursion method [duplica

2019-09-20 08:05发布

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)

1条回答
来,给爷笑一个
2楼-- · 2019-09-20 08:44

Anyway, I tried to solve this case using the classic recursive relation methodology. It's all about observing if a pattern exists:

enter image description here

Very expensive algorithm (Enemies of computer science are factorial and exponential orders of growth).

查看更多
登录 后发表回答