我试图找到使用递归树的Fibonacci系列的复杂性,并因此得出height of tree = O(n)最坏情况cost of each level = cncomplexity = n*n=n^2
height of tree = O(n)
cost of each level = cn
complexity = n*n=n^2
怎么回事O(2^n)？
O(2^n)
algorithm recursion big-o fibonacci
algorithm ×1
big-o ×1
fibonacci ×1
recursion ×1