正在加载图片...
Solving the recurrence 7(N)=T() T()+3 7(一)+k With 2K=N(or asymptotically), k=log N, we have g Thus, the running time is O(log N14 With 2k = N (or asymptotically), k=log N, we have Thus, the running time is O(log N) T(N) = k = log N k N T N T N T N T N T k = + = = + = + = + ) 2 ( ) 3 8 ( ) 2 4 ( ) 1 2 ( ) (  Solving the recurrence:
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有