Recursive Tree for T(n)=T(n/2)+T(n/3)+1

后端 未结 0 704
天命终不由人
天命终不由人 2021-01-19 22:07

I found a recursive tree for T(n)=T(n/2)+T(n/3)+n but still am confused about how the recursive tree is with a cost of 1 at each level.

what is its height?

How

相关标签:
回答
  • 消灭零回复
提交回复
热议问题